Random Walks with the Minimum Degree Local Rule Have O(N²) Cover Time

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms（2017）

引用 0|浏览0

暂无评分

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要

Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time