DBScholar

Back to papers

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)

Paper ID
6388
Venue
SIGMOD
Year
2022
Pagerank
5.1488731e-05
Overall Rank
10,101 | 30.70%
DOI
10.1145/3514221.3517874

Incoming Non-self Citations Over Time

Authors

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.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers