A combinatorial optimization algorithm for solving the branchwidth problem
From MaRDI portal
Publication:429498
DOI10.1007/s10589-011-9397-zzbMath1241.90121OpenAlexW2128021849MaRDI QIDQ429498
Elif Ulusal, J. Cole Smith, Illya V. Hicks
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.532.7201
Related Items (4)
A SAT Approach to Clique-Width ⋮ Tangle bases: Revisited ⋮ Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs ⋮ Treewidth computations. II. Lower bounds
Cites Work
- Unnamed Item
- Computing branchwidth via efficient triangulations and blocks
- Graph minors. X: Obstructions to tree-decomposition
- Call routing and the ratcatcher
- Graph minors. XIII: The disjoint paths problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tour Merging via Branch-Decomposition
- Planar Branch Decompositions II: The Cycle Method
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Easy problems for tree-decomposable graphs
- Complexity Results for Bandwidth Minimization
- Branch decompositions and minor containment
- Graphs, branchwidth, and tangles! Oh my!
- Contraction and Treewidth Lower Bounds
- STACS 2004
- On Exact Algorithms for Treewidth
This page was built for publication: A combinatorial optimization algorithm for solving the branchwidth problem
