45 citations · 95 across the 9 of their papers we have counts for
1 paper · 1 filter
Naoki Matsumoto, Yuuki Takai
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all vertices of the graph. It is known that the cov…