How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 121-132
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Evaluation of Shortest Journeys in Dynamic Networks2007
- Active query forwarding in sensor networksAd Hoc Networks, 2005
- Building a reference combinatorial model for MANETsIEEE Network, 2004
- Connectivity in evolving graph with geometric properties2004
- Efficient and robust query processing in dynamic environments using random walk techniques2004
- Crawling on Simple Models of Web GraphsInternet Mathematics, 2004
- Measuring index quality using random walks on the WebComputer Networks, 1999
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- A tight upper bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- Approximating the PermanentSIAM Journal on Computing, 1989