Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A Menger-like property of tree-width: the finite case
Journal of Combinatorial Theory Series B
A Kuratowski theorem for nonorientable surfaces
Journal of Combinatorial Theory Series B
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Graph minors. XI.: circuits on a surface
Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
The Structure and Number of Obstructions to Treewidth
SIAM Journal on Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Graphs with branchwidth at most three
Journal of Algorithms
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Constructive Linear Time Algorithms for Branchwidth
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Linear-time algorithms for graphs with bounded branchwidth
Linear-time algorithms for graphs with bounded branchwidth
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Treewidth computations II. Lower bounds
Information and Computation
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient 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.00 |
The notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour in their series of papers that proved Wagner's conjecture. Branch decompositions can be used to solve NP-hard problems modeled on graphs, but finding optimal branch decompositions of graphs is also NP-hard. This is the first of two papers dealing with the relationship of branchwidth and planar graphs. A practical implementation of an algorithm of Seymour and Thomas for only computing the branchwidth (not optimal branch decomposition) of any planar hypergraph is proposed. This implementation is used in a practical implementation of an algorithm of Seymour and Thomas for computing the optimal branch decompositions for planar hypergraphs that is presented in the second paper. Since memory requirements can become an issue with this algorithm, two other variations of the algorithm to handle larger hypergraphs are also presented.