搜索结果: 1-1 共查到“数理逻辑与数学基础 k-cover”相关记录1条 . 查询时间(0.083 秒)
We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small.
More precisely, for every D and C, there exists a=a(D,C)>0 such t...