Efficient Resistance Distance Computation: the Power of Landmark-based Approaches
Summary: Landmark-based resistance queries (single-pair and single-source) via v-absorbed random walks, forests, and a v-absorbed push. Three sampling-based plus one deterministic single-pair algorithm; online and two index-based single-source approximations exist. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Meihao Liao (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Qiangqiang Dai (Beijing Institute of Technology)
- 4. Hongyang Chen (Zhejiang Laboratory)
- 5. Hongchao Qin (Beijing Institute of Technology)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{liao_sigmod23,
title = {{Efficient Resistance Distance Computation: the Power of Landmark-based Approaches}},
author = {Liao, Meihao and Li, Rong-Hua and Dai, Qiangqiang and Chen, Hongyang and Qin, Hongchao and Wang, Guoren},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588922},
url = {https://dl.acm.org/doi/10.1145/3588922},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,911 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 5.3483178e-05 |
| 9,769 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD | 5.2209769e-05 |
| 10,240 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,366 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD | 5.093636e-05 |
| 10,560 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB | 5.093636e-05 |
| 11,172 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,769 | BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs | 2015 | SIGMOD | 9.7969398e-05 |
| 2,073 | BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart | 2017 | SIGMOD | 9.2209912e-05 |
| 2,173 | Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 2021 | SIGMOD | 9.0375634e-05 |
| 2,225 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 8.9183159e-05 |
| 5,826 | Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs | 2020 | VLDB | 6.074674e-05 |
| 6,284 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD | 5.927015e-05 |
| 6,655 | Indexed Fast Network Proximity Querying | 2018 | VLDB | 5.8125709e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,951 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB |
| 2 | 6,284 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD |
| 3 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 4 | 5,157 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD |
| 5 | 4,216 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB |
| 6 | 10,240 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD |
| 7 | 10,560 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 8 | 10,366 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD |
| 9 | 9,769 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD |
| 10 | 8,911 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD |