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

Authors:
Qian-Ping Gu;Hisao Tamaki
Affiliations:
Simon Fraser University, Burnaby, BC, Canada;Meiji University, Kawasaki, Japan
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2008

Citing 7
Cited 11

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Constructive Linear Time Algorithms for Branchwidth

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences
Planar Branch Decompositions II: The Cycle Method

INFORMS Journal on Computing

Computational study on planar dominating set problem

Theoretical Computer Science
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Journal of Discrete Algorithms
Computational study for planar connected dominating set problem

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+) time

Theoretical Computer Science
Fast sub-exponential algorithms and compactness in planar graphs

ESA'11 Proceedings of the 19th European conference on Algorithms
Exact distance oracles for planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate tree decompositions of planar graphs in linear time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Note: A note on planar graphs with large width parameters and small grid-minors

Discrete Applied Mathematics
Computational study on bidimensionality theory based algorithm for longest path problem

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Catalan structures and dynamic programming in H-minor-free graphs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.