On the time to traverse all edges of a graph
- 28 June 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 38 (6) , 335-337
- https://doi.org/10.1016/0020-0190(91)90091-u
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A technique for lower bounding the cover timePublished by Association for Computing Machinery (ACM) ,1990
- 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
- Covering Problems for Brownian Motion on SpheresThe Annals of Probability, 1988
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983