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)
Incoming Non-self Citations Over Time
Authors
- 1. Ada Wai-Chee Fu (Chinese University of Hong Kong)
- 2. Huanhuan Wu (Chinese University of Hong Kong)
- 3. James Cheng (Chinese University of Hong Kong)
- 4. Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
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.
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019937972 |
| 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018532516 |
| 968 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00012901559 |
| 1,232 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD | 0.00011566372 |
| 1,386 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00010950754 |
| 2,575 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.3982298e-05 |
| 3,857 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 7.0678455e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,979 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 2 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 3 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 4 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 5 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 6 | 4,403 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 7 | 2,152 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD |
| 8 | 1,232 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD |
| 9 | 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 10 | 1,553 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |