10 citations · 10 across the 5 of their papers we have counts for
1 paper · 1 filter
J. Kahn, J. H. Kim, L. Lovasz +1
The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time t…