Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks
Summary: Hierarchical cut 2-hop labelling (HC2L) merges hub/highway and tree-decomposition ideas via a balanced tree hierarchy to shrink distance labels and prune query search space. HC2Lp parallelizes preprocessing; on 10 real road networks it delivers 1.5–4x faster queries and up to 60% smaller labels, with comparable build times. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Muhammad Farhan
- 2. Henning Koehler
- 3. Robert Ohms
- 4. Qing Wang
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,472 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD | 4.3300131e-05 |
| 10,075 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD | 4.1905499e-05 |
| 10,171 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD | 4.1905499e-05 |
| 10,477 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 4.1905499e-05 |
| 10,524 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD | 4.1905499e-05 |
| 10,592 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 4.1905499e-05 |
| 10,677 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB | 4.1905499e-05 |
| 10,878 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030020929 |
| 1,385 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD | 0.00012259478 |
| 1,694 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00010870205 |
| 2,206 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 9.2958349e-05 |
| 3,346 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD | 7.1903469e-05 |
| 4,194 | Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks | 2022 | SIGMOD | 6.3640644e-05 |
Previous
Page 1 / 1
Next