DBScholar

Back to papers

Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs

Summary: Introduces Lanczos-based algorithms for resistance-distance computation: global Lanczos Iteration runs in Õ(√κm), while local Lanczos Push is graph-size independent. Both improve κ-dependence over SOTA and achieve strong empirical speedups and accuracy. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
14497
Venue
VLDB
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,560 | 27.55%
DOI
10.14778/3811243.3811244

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{yang_vldb26,
        title = {{Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs}},
        author = {Yang, Yichun and Lin, Longlong and Li, Rong-Hua and Liao, Meihao and Wang, Guoren},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {8},
        pages = {1688--1700},
        doi = {10.14778/3811243.3811244},
        url = {https://doi.org/10.14778/3811243.3811244},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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