Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Efficient algorithms for node disjoint subgraph homeomorphism determination
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Fast minor testing in planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Faster parameterized algorithms for minor containment
Theoretical Computer Science
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
Tree-width and the Sherali-Adams operator
Discrete Optimization
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming
INFORMS Journal on Computing
Square roots of minor closed graph classes
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given a simple graph G, a simple connected graph H, and a branch decomposition of G of width k, we present a practical algorithm to test if H is a minor of G. The notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour. The algorithm that we present follows the general framework for such an algorithm sketched by Robertson and Seymour with the addition of pruning techniques for runtime speedup. © 2003 Wiley Periodicals, Inc.