A combinatorial optimization algorithm for solving the branchwidth problem
From MaRDI portal
Publication:429498
DOI10.1007/S10589-011-9397-ZzbMATH Open1241.90121OpenAlexW2128021849MaRDI QIDQ429498FDOQ429498
Authors: J. Cole Smith, Elif Ulusal, 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
Recommendations
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- STACS 2004
- 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
- Easy problems for tree-decomposable graphs
- On Exact Algorithms for Treewidth
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Complexity Results for Bandwidth Minimization
- Planar branch decompositions. II: The cycle method
- Tour merging via branch-decomposition
- Branch decompositions and minor containment
- Contraction and Treewidth Lower Bounds
- Title not available (Why is that?)
- Graphs, branchwidth, and tangles! Oh my!
- Computing branchwidth via efficient triangulations and blocks
Cited In (9)
- Graphs, branchwidth, and tangles! Oh my!
- Treewidth computations. II. Lower bounds
- Title not available (Why is that?)
- A local search algorithm for branchwidth
- Tour merging via branch-decomposition
- Tangle bases: Revisited
- Title not available (Why is that?)
- A branch-and-branch algorithm for solving the group technology problem
- Recent Advances in Constraints
This page was built for publication: A combinatorial optimization algorithm for solving the branchwidth problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429498)
