A Tight Upper Bound on the Cover Time for Random Walks on Graphs

Uriel Feige. A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms, 6(1):51-54, 1995.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.