Shortest paths in digraphs of small treewidth. I: Sequential algorithms
From MaRDI portal
Publication:1578402
DOI10.1007/s004530010016zbMath0960.05097OpenAlexW2071362870MaRDI QIDQ1578402
Christos D. Zaroliagis, Shiva P. Chaudhuri
Publication date: 17 May 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010016
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (17)
Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ Efficient algorithms for center problems in cactus networks ⋮ Search-space size in contraction hierarchies ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Simple Parallel Algorithms for Dynamic Range Products ⋮ The inverse Voronoi problem in graphs. II: Trees ⋮ On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ Query efficient implementation of graphs of bounded clique-width ⋮ Unnamed Item ⋮ A $c^k n$ 5-Approximation Algorithm for Treewidth ⋮ Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Localized and compact data-structure for comparability graphs ⋮ Shortest path algorithms for nearly acyclic directed graphs ⋮ Unnamed Item ⋮ Distance Labeling for Permutation Graphs ⋮ Customizable Contraction Hierarchies
This page was built for publication: Shortest paths in digraphs of small treewidth. I: Sequential algorithms
