DBScholar

Back to papers

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)

Paper ID
h4464cf39fb4d0bc1
Venue
SIGMOD
Year
2027
Pagerank
4.9605343e-05
Overall Rank
10,414 | 30.20%
DOI
10.1145/3837129
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Rank Cited Paper Year Venue Pagerank
192 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00025740385
376 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00019655871
1,303 Computing Personalized PageRank Quickly by Exploiting Graph Structures 2014 VLDB 0.00011089258
1,581 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 0.00010151896
2,089 Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push 2021 SIGMOD 9.0473016e-05
2,188 HubPPR: Effective Indexing for Approximate Personalized PageRank 2017 VLDB 8.8879472e-05
2,794 P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators 2021 SIGMOD 7.987154e-05
3,988 Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme 2023 SIGMOD 6.8626164e-05
4,214 Scaling Up Distance Labeling on Graphs with Core-Periphery Properties 2020 SIGMOD 6.7186746e-05
4,924 Efficient Estimation of Pairwise Effective Resistance 2023 SIGMOD 6.3426926e-05
5,899 Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks 2023 SIGMOD 5.9376618e-05
6,047 Efficient Estimation of Heat Kernel PageRank for Local Clustering 2019 SIGMOD 5.8870311e-05
6,416 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD 5.7744984e-05
8,008 Efficient Resistance Distance Computation: the Power of Landmark-based Approaches 2023 SIGMOD 5.3916283e-05
8,251 Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches 2023 SIGMOD 5.3537264e-05
8,655 Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach 2024 SIGMOD 5.2794257e-05
8,695 Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks 2025 SIGMOD 5.2717835e-05
9,685 Efficient Approximation of Kemeny’s Constant for Large Graphs 2024 SIGMOD 5.1258854e-05
9,988 Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs 2025 SIGMOD 5.0845476e-05
10,638 Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach 2026 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers