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
- 2. Miao Qiao
- 3. Lu Qin
- 4. Lijun Chang
- 5. Ying Zhang
- 6. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 11,211 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD | 4.1945683e-05 |
| 13,090 | 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 |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 1,665 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010967716 |
Previous
Page 1 / 1
Next