Date: 2014-09-26 08:36:22Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition | | Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.pAdd to Reading ListSource URL: disco.ethz.chDownload Document from Source Website File Size: 412,96 KBShare Document on Facebook
|