Back to papers
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
Summary: Shows resistance distance on small-treewidth graphs depends only on labels along s/t root paths in a tree decomposition, bypassing costly matrix ops. TreeIndex: O(n h) labelling (build O(n h^2 dmax)), exact single-pair O(h) and single-source O(n h) queries; first exact method scalable to continental road networks.
(summarized by gpt-5-mini on Feb 11 2026)
- Paper ID
- 7384
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,075 | 29.92%
- DOI
-
10.1145/3769788
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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 |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 376 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025097452 |
| 1,821 |
Computing Personalized PageRank Quickly by Exploiting Graph Structures |
2014 |
VLDB |
0.00010423565 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 1,838 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010349881 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 5,015 |
Challenging the Long Tail Recommendation |
2012 |
VLDB |
5.7584513e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 6,093 |
Density-based Place Clustering in Geo-Social Networks |
2014 |
SIGMOD |
5.2131159e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 7,394 |
Efficient Estimation of Pairwise Effective Resistance |
2023 |
SIGMOD |
4.7427524e-05 |
| 9,245 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3690661e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 9,642 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3109001e-05 |
| 10,957 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1945683e-05 |
Semantically Similar Papers