scientific article; zbMATH DE number 7651159
From MaRDI portal
Publication:5874487
DOI10.4230/LIPIcs.ESA.2020.20MaRDI QIDQ5874487
Sabine Storandt, Johannes Blum
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Customizable hub labeling: properties and algorithms ⋮ Fission: Practical algorithms for computing minimum balanced node separators
Cites Work
- Unnamed Item
- Unnamed Item
- Search-space size in contraction hierarchies
- Optimal node ranking of tree in linear time
- Directed tree-width
- Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
- Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
- Preprocessing Speed-Up Techniques Is Hard
- Constant factor approximation of vertex-cuts in planar graphs
- On the Problem of Partitioning Planar Graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Reachability and Distance Queries via 2-Hop Labels
- Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
- Customizable Contraction Hierarchies
- Search-Space Size in Contraction Hierarchies
This page was built for publication:
