1 paper
Guanhua Fang, Gennady Samorodnitsky, Zhiqiang Xu
Given a traversal algorithm, cover time is the expected number of steps needed to visit all nodes in a given graph. A smaller cover time means a higher exploration efficiency of tr…