论文信息 - Optimal branch-decomposition of planar graphs in O(n3) Time

Optimal branch-decomposition of planar graphs in O(n3) Time

We give an O(n3) time algorithm for constructing a minimum-width branch-decomposition of a given planar graph with n vertices. This is achieved through a refinement to the previously best known algorithm of Seymour and Thomas, which runs in O(n4) time.

Hisao Tamaki | Qian-Ping Gu | H. Tamaki | Q. Gu

[1] Hisao Tamaki,et al. Optimal Branch-Decomposition of Planar Graphs in O(n3) Time , 2005, ICALP.

[2] Illya V. Hicks. Planar Branch Decompositions II: The Cycle Method , 2005, INFORMS J. Comput..

[3] Dimitrios M. Thilikos,et al. Constructive Linear Time Algorithms for Branchwidth , 1997, ICALP.

[4] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[5] Erik D. Demaine,et al. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors , 2004, J. Comput. Syst. Sci..

[6] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .

[7] Robin Thomas,et al. Call routing and the ratcatcher , 1994, Comb..

[8] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[9] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[10] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..

[11] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[12] Arie M. C. A. Koster,et al. Branch and Tree Decomposition Techniques for Discrete Optimization , 2005 .

[13] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.