Dynamic algorithms for graphs of bounded treewidth

DOI10.1007/3-540-63165-8_186zbMath1401.68248OpenAlexW1492184529MaRDI QIDQ4571961

Torben Hagerup

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_186

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Unnamed Item
• Monadic second-order evaluations on tree-decomposable graphs
• Computing on a free tree via complexity-preserving mappings
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• A partial k-arboretum of graphs with bounded treewidth
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• All-pairs min-cut in sparse networks
• Fast Algorithms for Finding Nearest Common Ancestors
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Shortest path queries in digraphs of small treewidth
• Linear-time computation of optimal subgraphs of decomposable graphs
• An Algebraic Model for Combinatorial Problems
• Efficient algorithms for solving systems of linear equations and path problems
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Dynamic algorithms for graphs of bounded treewidth