scientific article; zbMATH DE number 1990711

MaRDI QIDQ4430877zbMATH OpenFDO

Authors Illya V. Hicks

Publication date 13 October 2003

zbMATH Keywords

branch decompositionsWagner's conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Planar branch decompositions. I: The ratcatcher
• A combinatorial optimization algorithm for solving the branchwidth problem
• Practical algorithms for branch-decompositions of planar graphs
• Planar branch decompositions. II: The cycle method
• A linear time heuristic for the branch-decomposition of planar graphs

Cited in

(11)

• Branch decomposition heuristics for linear matroids
• A SAT approach to branchwidth
• Tour merging via branch-decomposition
• A local search algorithm for branchwidth
• A combinatorial optimization algorithm for solving the branchwidth problem
• Constructive linear time algorithms for branchwidth
• A branch decomposition algorithm for the p-median problem
• Graphs, branchwidth, and tangles! Oh my!
• Fast FPT-approximation of branchwidth
• Tangle bases: Revisited
• Bounding branch-width

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430877)