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
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.01 |
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.