Deterministic approximation of the cover time

DOI10.1002/rsa.10083zbMath1048.68061OpenAlexW1989885196MaRDI QIDQ4417001

Yuri Rabinovich

Publication date: 6 August 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10083

zbMATH Keywords

random walk

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Approximation algorithms (68W25)

Related Items (2)

On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems ⋮ Improved approximation of the minimum cover time

This page was built for publication: Deterministic approximation of the cover time