On the time to traverse all edges of a graph

DOI10.1016/0020-0190(91)90091-UzbMath0736.68067MaRDI QIDQ1178251

David Zuckerman

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

random walkcover time

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The electrical resistance of a graph captures its commute and cover times ⋮ On a cover time problem on a dynamic graph with steps at random times ⋮ New Bounds for Edge-Cover by Random Walk

Cites Work

• Unnamed Item
• Covering problems for Brownian motion on spheres
• Bounds on the cover time
• On the cover time of random walks on graphs
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• On the time taken by random walks on finite groups to visit every state