Reduction algorithms for constructing solutions in graphs with small treewidth

DOI10.1007/3-540-61332-3_153zbMATH Open1529.68195OpenAlexW1589594187MaRDI QIDQ6184664FDOQ6184664

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

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

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)

Cites Work

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

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)