Deterministic approximation of the cover time ( Preliminary version )

@inproceedings{Feige2007DeterministicAO,
  title={Deterministic approximation of the cover time ( Preliminary version )},
  author={Uriel Feige and Yuri Rabinovich},
  year={2007}
}
The cover time is the expected time it takes a simple random walk to cover all vertices of a graph. It arises in numerous questions related to the behaviour of random walks on graphs. Despite the fact that it can be approximated with arbitrary precision by a simple polynomial time Monte-Carlo algorithm which simulates the random walk, it is not known whether the cover time of a graph can be computed in determin-istic PTIME. In the present paper we establish a deterministic polynomial time… CONTINUE READING