Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Hi-index | 0.89 |