Reduction algorithms for constructing solutions in graphs with small treewidth

DOI10.1007/3-540-61332-3_153zbMath1529.68195OpenAlexW1589594187MaRDI QIDQ6184664

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 theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A Retrospective on (Meta) Kernelization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• An algebraic theory of graph reduction
• Parallel algorithms with optimal speedup for bounded treewidth

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