DBScholar

Back to papers

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks

Summary: Hop Doubling Labeling for point-to-point distance querying on scale-free graphs; novel hop-doubling index for directed/undirected, unweighted networks. Bounds on index size, compute and I/O costs derived from scale-free properties; empirically outperforms state-of-the-art and scales to graphs orders of magnitude larger. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10967
Venue
VLDB
Year
2014
Pagerank
0.0001037809
Overall Rank
1,553 | 89.35%
DOI
10.14778/2733004.2733012

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{jiang_vldb14,
        title = {{Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks}},
        author = {Jiang, Minhao and Fu, Ada Wai-Chee and Wong, Raymond Chi-Wing and Xu, Yanyan},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {12},
        pages = {1203--1214},
        doi = {10.14778/2733004.2733012},
        url = {https://doi.org/10.14778/2733004.2733012},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
927 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00013161079
1,309 An Experimental Study on Hub Labeling based Shortest Path Algorithms 2018 VLDB 0.00011210911
1,613 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 0.00010216983
2,152 Scaling Distance Labeling on Small-World Networks 2019 SIGMOD 9.0778596e-05
2,871 P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators 2021 SIGMOD 8.0110616e-05
3,612 Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks 2022 SIGMOD 7.2579119e-05
4,403 Scaling Up Distance Labeling on Graphs with Core-Periphery Properties 2020 SIGMOD 6.7229209e-05
5,044 Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs 2021 VLDB 6.3883109e-05
5,571 Hub Labeling for Shortest Path Counting 2020 SIGMOD 6.1686653e-05
5,678 Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement 2022 VLDB 6.1246854e-05
6,844 An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network 2021 VLDB 5.7566172e-05
6,940 Exact Top-k Nearest Keyword Search in Large Networks 2015 SIGMOD 5.7331991e-05
7,153 Towards Maximum Independent Sets on Massive Graphs 2015 VLDB 5.6872221e-05
7,664 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.5720259e-05
9,003 Planting Trees for scalable and efficient Canonical Hub Labeling 2020 VLDB 5.3345443e-05
9,358 SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries 2017 VLDB 5.2822032e-05
10,366 Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach 2026 SIGMOD 5.093636e-05
10,788 Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks 2025 SIGMOD 5.093636e-05
11,248 Distributed Shortest Distance Labeling on Large-Scale Graphs 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers