Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs
Summary: Tree+DAG combines Cholesky-based TreeIndex for tree-like peripheries with loop-erased-walk DAG indexing for rapidly mixing cores, exploiting core-periphery structure. It achieves near-linear index construction and size with substantially faster resistance-distance queries than LEIndex. (summarized by gpt-6-luna on Oct 22 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Meihao Liao (Beijing Institute of Technology)
- 2. Bao Xing (Beijing Institute of Technology)
- 3. Rong-Hua Li (Beijing Institute of Technology)
- 4. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{liao_sigmod27,
title = {{Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs}},
author = {Liao, Meihao and Xing, Bao and Li, Rong-Hua and Wang, Guoren},
series = {{SIGMOD} '27},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3837129},
url = {https://dl.acm.org/doi/10.1145/3837129},
year = {2027}
}
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 20 of 20 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 | 3,933 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |
| 2 | 10,813 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 3 | 9,254 | One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor | 2026 | SIGMOD |
| 4 | 734 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB |
| 5 | 6,806 | Indexed Fast Network Proximity Querying | 2018 | VLDB |
| 6 | 8,008 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |
| 7 | 8,655 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD |
| 8 | 4,214 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 9 | 9,988 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD |
| 10 | 10,638 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD |