Short Random Walks on Graphs
- 1 February 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 9 (1) , 19-28
- https://doi.org/10.1137/s0895480194264988
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Security preserving amplification of hardnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Collisions Among Random Walks on a GraphSIAM Journal on Discrete Mathematics, 1993
- On the time to traverse all edges of a graphInformation Processing Letters, 1991
- On the cover time of random walks on graphsJournal of Theoretical Probability, 1989
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979