A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs
Summary: Highway-Centric Labeling for shortest-path queries in large sparse graphs, with highway-structure and bipartite cover. Outperforms 2-hop in index size and query time, with exact distances and bounded-accuracy approximations; validated on synthetic/real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ruoming Jin
- 2. Ning Ruan
- 3. Yang Xiang
- 4. Victor E. Lee
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
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 |
|---|---|---|---|---|
| 186 | Proximity Search in Databases | 1998 | VLDB | 0.00036215179 |
| 279 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00029113513 |
| 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00025097452 |
| 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00023310419 |
| 945 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00015137526 |
| 1,054 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00014422699 |
Previous
Page 1 / 1
Next