The paper gives an O~(m^1.5 epsilon^-1) time algorithm for approximate spanning tree counting using recursive deletion of uncorrelated edge sets found via electrical-flow localization.
Localization of Electrical Flows
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that in any graph, the average length of a flow path in an electrical flow between the endpoints of a random edge is $O(\log^2 n)$. This is a consequence of a more general result which shows that the spectral norm of the entrywise absolute value of the transfer impedance matrix of a graph is $O(\log^2 n)$. This result implies a simple oblivious routing scheme based on electrical flows in the case of transitive graphs.
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximate Spanning Tree Counting from Uncorrelated Edge Sets
The paper gives an O~(m^1.5 epsilon^-1) time algorithm for approximate spanning tree counting using recursive deletion of uncorrelated edge sets found via electrical-flow localization.