A combinatorial optimization algorithm for solving the branchwidth problem
From MaRDI portal
(Redirected from Publication:429498)
Recommendations
Cites work
- scientific article; zbMATH DE number 1990711 (Why is no real title available?)
- Branch decompositions and minor containment
- Call routing and the ratcatcher
- Complexity Results for Bandwidth Minimization
- Computing branchwidth via efficient triangulations and blocks
- Contraction and Treewidth Lower Bounds
- Easy problems for tree-decomposable graphs
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graphs, branchwidth, and tangles! Oh my!
- On Exact Algorithms for Treewidth
- Planar branch decompositions. II: The cycle method
- STACS 2004
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tour merging via branch-decomposition
Cited in
(9)- Graphs, branchwidth, and tangles! Oh my!
- Treewidth computations. II. Lower bounds
- scientific article; zbMATH DE number 1990711 (Why is no real title available?)
- A local search algorithm for branchwidth
- Tour merging via branch-decomposition
- Tangle bases: Revisited
- scientific article; zbMATH DE number 3997557 (Why is no real title available?)
- 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)
