The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis
Summary: Introduces the metric backbone: the smallest subgraph preserving all-pairs shortest paths; exploits semi-metricity to prune edges for large graphs. Presents a distributed heuristic; shows 6.7x speedups in Neo4j and 6x in Giraph on large real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,342 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD | 7.197276e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 37 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.0007522744 |
| 388 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024662272 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |
| 1,579 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011283792 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 788 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00016650034 |
| 8,885 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 4.4282232e-05 |
| 1,054 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00014422699 |
| 1,378 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD | 0.00012294512 |
| 8,256 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB | 4.5490743e-05 |
| 5,597 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB | 5.4178241e-05 |
| 5,932 | Hub Labeling for Shortest Path Counting | 2020 | SIGMOD | 5.2670741e-05 |
| 6,138 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1915368e-05 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |