Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Chordal completion of a planar graph

Status
Not open for further replies.
G

Grigory

Newbie level 4
Newbie level 4
Joined
Mar 30, 2011
Messages
7
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,325
Hello,

Help me, please, to find algorithm for constructing a chordal completion of a planar graph. In paper "CHORDAL COMPLETIONS OF PLANAR GRAPHS" (authors F. R. K. CHUNG and DAVID MUMFORD) one is proved that every planar graph on n vertices has a chordal completion with cn log n edges for some absolute constant c.

But I need algorithm itself; or even perhaps there is library (e.g. boost) that includes the algorithm?

Thanks
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top