DBScholar

Back to papers

IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying

Summary: IS-LABEL, a novel independent-set based labeling scheme for point-to-point distance querying. Its labeling leverages graph independent sets to support fast distance queries, achieving order-of-magnitude scalability beyond prior indexes (beyond ~1M vertices) for large real-world graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10898
Venue
VLDB
Year
2013
Pagerank
0.00010201102
Overall Rank
1,622 | 88.88%
DOI
10.14778/2536336.2536340

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{fu_vldb13,
        title = {{IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying}},
        author = {Fu, Ada Wai-Chee and Wu, Huanhuan and Cheng, James and Wong, Raymond Chi-Wing},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {6},
        pages = {457--468},
        doi = {10.14778/2536336.2536340},
        url = {https://doi.org/10.14778/2536336.2536340},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
1,123 Path Problems in Temporal Graphs 2014 VLDB 0.00012089975
1,309 An Experimental Study on Hub Labeling based Shortest Path Algorithms 2018 VLDB 0.00011210911
1,533 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010467148
1,553 Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks 2014 VLDB 0.0001037809
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,278 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.5712342e-05
3,612 Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks 2022 SIGMOD 7.2579119e-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
5,784 Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks 2021 SIGMOD 6.0896788e-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,158 BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale 2022 SIGMOD 5.6858492e-05
7,764 Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling 2017 SIGMOD 5.5499989e-05
9,003 Planting Trees for scalable and efficient Canonical Hub Labeling 2020 VLDB 5.3345443e-05
10,366 Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach 2026 SIGMOD 5.093636e-05
10,498 Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC 2026 SIGMOD 5.093636e-05
11,248 Distributed Shortest Distance Labeling on Large-Scale Graphs 2024 VLDB 5.093636e-05
11,439 TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks 2023 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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