Dynamic algorithms for graphs with treewidth 2

DOI10.1007/3-540-57899-4_45MaRDI QIDQ6143969zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Dynamic algorithms for graphs of bounded treewidth
• Dynamic algorithms for graphs of bounded treewidth
• On the treewidth of dynamic graphs
• On the treewidth of dynamic graphs
• scientific article; zbMATH DE number 4060712
• scientific article; zbMATH DE number 1323192
• scientific article; zbMATH DE number 1031380
• Dynamic Algorithms for Graph Spanners
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• scientific article; zbMATH DE number 1617242

Cites work

• A linear time algorithm for finding tree-decompositions of small treewidth
• A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
• Algorithms finding tree-decompositions of graphs
• 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 437542 (Why is no real title available?)
• scientific article; zbMATH DE number 1263263 (Why is no real title available?)
• scientific article; zbMATH DE number 475614 (Why is no real title available?)
• scientific article; zbMATH DE number 1142299 (Why is no real title available?)
• Maintaining regular properties dynamically in k-terminal graphs
• Parametric problems on graphs of bounded tree-width

Cited in

(4)

• The dynamic complexity of acyclic hypergraph homomorphisms
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Efficient algorithms for shortest path queries in planar digraphs
• Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number

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

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