DBScholar

Back to papers

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)

Paper ID
6960
Venue
SIGMOD
Year
2024
Pagerank
5.3483178e-05
Overall Rank
8,911 | 38.87%
DOI
10.1145/3654936

Incoming Non-self Citations Over Time

Authors

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 4 of 4 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
195 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00025813775
784 Near Neighbor Search in Large Metric Spaces 1995 VLDB 0.00014069958
1,339 Computing Personalized PageRank Quickly by Exploiting Graph Structures 2014 VLDB 0.00011112799
1,613 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 0.00010216983
1,769 BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs 2015 SIGMOD 9.7969398e-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
4,024 TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs 2018 SIGMOD 6.9479974e-05
4,272 Challenging the Long Tail Recommendation 2012 VLDB 6.7911017e-05
4,651 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.585234e-05
5,157 Efficient Estimation of Pairwise Effective Resistance 2023 SIGMOD 6.3409526e-05
5,236 Localizing Anomalous Changes in Time-evolving Graphs 2014 SIGMOD 6.3044413e-05
5,678 Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement 2022 VLDB 6.1246854e-05
5,741 Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks 2018 SIGMOD 6.1029326e-05
5,851 k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation 2016 VLDB 6.0659596e-05
5,913 Efficient Estimation of Heat Kernel PageRank for Local Clustering 2019 SIGMOD 6.0439971e-05
7,861 Efficient Resistance Distance Computation: the Power of Landmark-based Approaches 2023 SIGMOD 5.5302333e-05
8,062 Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches 2023 SIGMOD 5.4949527e-05
Previous Page 1 / 1 Next

Semantically Similar Papers