Yusuke Hosaka

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Random walk is a powerful tool for searching a network, especially for a very large network such as the Internet. The cover time is an important measure of a random walk on a finite graph, and has been studied well. For the purpose of searching a network, it is quite natural to think that multiple crawlers might cover a network faster than a single crawler.(More)
  • 1