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

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 373-384

  Gu, Qian Ping ^a   Tamaki, Hisao ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

OPTIMAL BRANCH-DECOMPOSITION; PLANAR GRAPHS; REFINEMENT; VERTICES;

GRAPH THEORY;

EID: 26444569343     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_31     Document Type: Conference Paper

References (9)

1. S. Arnborg, D.G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM Journal on Algebraic and Discrete Methods, 8: 277-284, 1987
2. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, 12: 308-340, 1991
3. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, 11: 1-21, 1993.
4. H.L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, 25: 1305-1317, 1996.
5. E.D. Demaine, M.T. Hajiaghayi, N. Nishimura, P. Ragde, and D.M. Thilikos, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Journal of Computer and System Sciences, 69-2: 166-195, 2004.
6. N. Robertson and P.D. Seymour, Graph minors I. Excluding a forest, Journal of Combinatorial Theory, Series B, 35: 39-61, 1983
7. N. Robertson and P.D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, 7: 309-322, 1986
8. N. Robertson and P.D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, 52: 153-190, 1991
9. P.D. Seymour and R. Thomas, Call Routing and the Ratcatcher. Combinatorica, 14(2), 217-241, 1994