TreeIndex builds a tree-decomposition labelling that computes exact resistance distances in O(h) time per query with O(n·h) size, and scales to the 23.9M-node US road network.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
TreeIndex builds a tree-decomposition labelling that computes exact resistance distances in O(h) time per query with O(n·h) size, and scales to the 23.9M-node US road network.