Reduction algorithms for constructing solutions in graphs with small treewidth

DOI10.1007/3-540-61332-3_153MaRDI QIDQ6184664zbMATH OpenOpenAlexFDO

Authors Hans L. Bodlaender, Babette de Fluiter

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61332-3_153

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Reduction algorithms for graphs of small treewidth
• On reduction algorithms for graphs with small treewidth
• scientific article; zbMATH DE number 219268
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth

Cites work

• An algebraic theory of graph reduction
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 475614 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• Parallel algorithms with optimal speedup for bounded treewidth
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(2)

• A Retrospective on (Meta) Kernelization
• On reduction algorithms for graphs with small treewidth

This page was built for publication: Reduction algorithms for constructing solutions in graphs with small treewidth

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