On Scalable Computation of Graph Eccentricities
Summary: Proposes IFECC, a scalable exact eccentricity algorithm that requires no precomputed index and handles billion-scale graphs. Delivers two orders of magnitude speedup over PLLECC and enables anytime termination for stable approximate eccentricities, beating kBFS. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wentao Li (University of Technology Sydney)
- 2. Miao Qiao (University of Auckland)
- 3. Lu Qin (University of Technology Sydney)
- 4. Lijun Chang (University of Sydney)
- 5. Ying Zhang (University of Technology Sydney)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@inproceedings{li_sigmod22,
title = {{On Scalable Computation of Graph Eccentricities}},
author = {Li, Wentao and Qiao, Miao and Qin, Lu and Chang, Lijun and Zhang, Ying and Lin, Xuemin},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517874},
url = {https://dl.acm.org/doi/10.1145/3514221.3517874},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
| 11,412 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD | 5.093636e-05 |
| 13,294 | TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs | 2026 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 1,432 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.0001080346 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,065 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB |
| 2 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 3 | 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 4 | 8,746 | Fully Dynamic Betweenness Centrality Maintenance on Massive Networks | 2016 | VLDB |
| 5 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 6 | 7,211 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB |
| 7 | 11,271 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB |
| 8 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 9 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 10 | 13,294 | TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs | 2026 | VLDB |