Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach

2025-09-05

AI Summary

Computing resistance distance on low-treewidth graphs (e.g., road networks) suffers from poor efficiency and intractability of exact solutions. To address this, we propose TreeIndex—a compact label indexing framework based on tree decomposition. We first uncover the *label locality* of resistance distance within tree decompositions and design a path-dependent label structure enabling fast, exact queries for both single-pair and single-source scenarios. By integrating tree decomposition, graph labeling, and linear-algebraic optimizations, TreeIndex achieves scalability parameterized by tree height and maximum bag degree—both treated as constants. On the full U.S. road network (405 GB index), index construction takes only 7 hours, while query latency is merely 0.001 seconds per pair. This work marks the first solution enabling exact, efficient, and scalable resistance distance computation on massive real-world graphs.

Technology Category

• Search and Optimization: Distributed Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Machine Learning: Graph-based Machine Learning

Application Category

• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Resistance distance computation is a fundamental problem in graph analysis, yet existing random walk-based methods are limited to approximate solutions and suffer from poor efficiency on small-treewidth graphs (e.g., road networks). In contrast, shortest-path distance computation achieves remarkable efficiency on such graphs by leveraging cut properties and tree decompositions. Motivated by this disparity, we first analyze the cut property of resistance distance. While a direct generalization proves impractical due to costly matrix operations, we overcome this limitation by integrating tree decompositions, revealing that the resistance distance $r(s,t)$ depends only on labels along the paths from $s$ and $t$ to the root of the decomposition. This insight enables compact labelling structures. Based on this, we propose reeindex, a novel index method that constructs a resistance distance labelling of size $O(n cdot h_{mathcal{G}})$ in $O(n cdot h_{mathcal{G}}^2 cdot d_{max})$ time, where $h_{mathcal{G}}$ (tree height) and $d_{max}$ (maximum degree) behave as small constants in many real-world small-treewidth graphs (e.g., road networks). Our labelling supports exact single-pair queries in $O(h_{mathcal{G}})$ time and single-source queries in $O(n cdot h_{mathcal{G}})$ time. Extensive experiments show that TreeIndex substantially outperforms state-of-the-art approaches. For instance, on the full USA road network, it constructs a $405$ GB labelling in $7$ hours (single-threaded) and answers exact single-pair queries in $10^{-3}$ seconds and single-source queries in $190$ seconds--the first exact method scalable to such large graphs.

Problem

• Exact resistance distance computation on small-treewidth graphs
• Overcoming inefficiency of random walk-based approximation methods
• Enabling scalable exact queries for large road networks

Innovation

• Uses tree decomposition for exact resistance computation
• Implements compact labeling with linear size scaling
• Enables fast exact queries on large road networks