Planar branch decompositions. II: The cycle method
From MaRDI portal
Recommendations
- Planar branch decompositions. I: The ratcatcher
- Practical algorithms for branch-decompositions of planar graphs
- scientific article; zbMATH DE number 1157653
- A linear time heuristic for the branch-decomposition of planar graphs
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
- Algorithms for the implementation of the analytic classification of plane branches
- scientific article; zbMATH DE number 3997557
Cited in
(12)- Tour merging via branch-decomposition
- Planar branch decompositions. I: The ratcatcher
- A local search algorithm for branchwidth
- New analysis and computational study for the planar connected dominating set problem
- scientific article; zbMATH DE number 4128653 (Why is no real title available?)
- A combinatorial optimization algorithm for solving the branchwidth problem
- scientific article; zbMATH DE number 1990711 (Why is no real title available?)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- A linear time heuristic for the branch-decomposition of planar graphs
- On the minimum corridor connection problem and other generalized geometric problems
- Practical algorithms for branch-decompositions of planar graphs
- Treewidth lower bounds with brambles
This page was built for publication: Planar branch decompositions. II: The cycle method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892258)