Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga. How many vertices does a random walk miss in a network with moderately increasing the number of vertices?. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2021. 106-122
Analyses of the cover time of deterministic random walks
(The 21st Conference of the International Federation of Operational Research Societies (IFORS 2017) 2017)