The electrical resistance of a graph captures its commute and cover times
- 1 December 1996
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 6 (4) , 312-340
- https://doi.org/10.1007/bf01270385
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Short Random Walks on GraphsSIAM Journal on Discrete Mathematics, 1996
- Trading Space for Time in Undirected s-t ConnectivitySIAM Journal on Computing, 1994
- Lower bounds on the length of universal traversal sequencesJournal of Computer and System Sciences, 1992
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- Eigenvalues and expandersCombinatorica, 1986
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979