Search-space size in contraction hierarchies
From MaRDI portal
Publication:306264
DOI10.1016/j.tcs.2016.07.003zbMath1348.68173OpenAlexW2465485717MaRDI QIDQ306264
Dorothea Wagner, Ignaz Rutter, Reinhard Bauer, Tobias Columbus
Publication date: 31 August 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.003
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Customizable hub labeling: properties and algorithms ⋮ Fission: Practical algorithms for computing minimum balanced node separators ⋮ Unnamed Item ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal triangulations of graphs: a survey
- The analysis of a nested dissection algorithm
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Optimal node ranking of tree in linear time
- User-Constrained Multimodal Route Planning
- Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
- VC-Dimension and Shortest Path Algorithms
- The Use of Linear Graphs in Gauss Elimination
- Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
- Preprocessing Speed-Up Techniques Is Hard
- Generalized Nested Dissection
- A New Implementation of Sparse Gaussian Elimination
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Minimum time-dependent travel times with contraction hierarchies
- Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
- Compact oracles for reachability and approximate distances in planar digraphs
- Nested Dissection of a Regular Finite Element Mesh
This page was built for publication: Search-space size in contraction hierarchies
