Grigory
Newbie level 4
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
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