Dynamic algorithms for graphs with treewidth 2

DOI10.1007/3-540-57899-4_45zbMath1528.68271OpenAlexW2160098350MaRDI QIDQ6143969

Hans L. Bodlaender

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/21982

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ The dynamic complexity of acyclic hypergraph homomorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Maintaining regular properties dynamically in \(k\)-terminal graphs
• A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
• Algorithms finding tree-decompositions of graphs
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Parametric problems on graphs of bounded tree-width
• A linear time algorithm for finding tree-decompositions of small treewidth

This page was built for publication: Dynamic algorithms for graphs with treewidth 2