Back to papers
Hub Labeling for Shortest Path Counting
Summary: Hub labeling for counting shortest paths via hub pushing; index size reduced by graph-reduction techniques. Theoretical results for select graph classes; empirical study shows query times in hundreds of microseconds on graphs with hundreds of millions of edges.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5952
- Venue
- SIGMOD
- Year
- 2020
- Pagerank
- 5.2670741e-05
- Overall Rank
- 5,932 | 58.74%
- DOI
-
10.1145/3318464.3389737
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 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.00030040036 |
| 301 |
BLINKS: Ranked Keyword Searches on Graphs |
2007 |
SIGMOD |
0.00028370644 |
| 376 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025097452 |
| 1,378 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012294512 |
| 1,579 |
Query Preserving Graph Compression |
2012 |
SIGMOD |
0.00011283792 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 1,838 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010349881 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 4,067 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4795399e-05 |
| 7,277 |
Exact Top-k Nearest Keyword Search in Large Networks |
2015 |
SIGMOD |
4.7794907e-05 |
| 7,315 |
Nearest Keyword Search in XML Documents |
2011 |
SIGMOD |
4.7645064e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 1,838 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010349881 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 10,584 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 10,515 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 1,378 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012294512 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |