Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach
Summary: Index-based effective-resistance computation via multiple landmarks: precompute compact Schur-complement matrices over a landmark set, then answer single-pair/source queries with Vl-absorbed random-walk push/sampling. Provable accuracy/performance guarantees; up to 10^4× speedup on large graphs. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Meihao Liao (Beijing Institute of Technology)
- 2. Junjie Zhou (Beijing Institute of Technology)
- 3. Rong-Hua Li (Beijing Institute of Technology)
- 4. Qiangqiang Dai (Beijing Institute of Technology)
- 5. Hongyang Chen (Zhejiang Lab)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{liao_sigmod24,
title = {{Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach}},
author = {Liao, Meihao and Zhou, Junjie and Li, Rong-Hua and Dai, Qiangqiang and Chen, Hongyang and Wang, Guoren},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654936},
url = {https://dl.acm.org/doi/10.1145/3654936},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,947 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD | 5.1038322e-05 |
| 10,455 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,564 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD | 4.9793485e-05 |
| 10,742 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB | 4.9793485e-05 |
| 10,939 | BiLink: Bidirectional Meta-paths for Link Discovery in Billion-Scale Heterogeneous Graphs | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,864 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB |
| 2 | 10,636 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 3 | 5,273 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD |
| 4 | 2,540 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 5 | 9,805 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 6 | 6,765 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 7 | 10,742 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 8 | 10,564 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD |
| 9 | 9,947 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD |
| 10 | 8,020 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |