Crawling on Simple Models of Web Graphs
From MaRDI portal
Publication:4673814
DOI10.1080/15427951.2004.10129078zbMath1066.05136OpenAlexW2004943036MaRDI QIDQ4673814
Publication date: 9 May 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129078
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Slow emergence of the giant component in the growing m‐out graph ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ Reversible random walks on dynamic graphs ⋮ On a cover time problem on a dynamic graph with steps at random times ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ Exploration of carrier-based time-varying networks: the power of waiting ⋮ Random walks between leaves of random networks ⋮ Out-of-equilibrium random walks
This page was built for publication: Crawling on Simple Models of Web Graphs