Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
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
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
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
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
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
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
| Hi-index | 0.00 |
This is the second of two papers dealing with the relationship of branchwidth and planar graphs. Branchwidth and branch decompositions, introduced by Robertson and Seymour, have been shown to be beneficial for both proving theoretical results on graphs and solving NP-hard problems modeled on graphs. The first practical implementation of an algorithm of Seymour and Thomas for computing optimal branch decompositions of planar hypergraphs is presented. This algorithm encompasses another algorithm of Seymour and Thomas for computing the branchwidth of any planar hypergraph, whose implementation is discussed in the first paper. The implementation also includes the addition of a heuristic to decrease the run times of the algorithm. This method, called the cycle method, is an improvement on the algorithm by using a â聙聹divide-and-conquerâ聙聺 approach.