The cover time of sparse random graphs
- 13 December 2006
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 30 (1-2) , 1-16
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Random Graphs2001
- Random Graphs2000
- On the Cover Time for Random Walks on Random GraphsCombinatorics, Probability and Computing, 1998
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- A tight upper bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- An algorithm for finding hamilton paths and cycles in random graphsCombinatorica, 1987
- Random walks, universal traversal sequences, and the complexity of maze problems1979