Treewidth: Structure and Algorithms
From MaRDI portal
Publication:5425956
DOI10.1007/978-3-540-72951-8_3zbMath1201.05076OpenAlexW1592452925MaRDI QIDQ5425956
Publication date: 15 November 2007
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_3
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
Unnamed Item ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Graph Bisection with Pareto Optimization ⋮ Secluded connectivity problems ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ Compact labelings for efficient first-order model-checking ⋮ On the algorithmic effectiveness of digraph decompositions and complexity measures ⋮ The complexity of minimum-length path decompositions ⋮ Minimal interval completion through graph exploration ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth ⋮ Customizable Contraction Hierarchies
This page was built for publication: Treewidth: Structure and Algorithms
