Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

FOCS
2000
IEEE

favoriteEmaildiscussreport

62views Theoretical Computer Science» more FOCS 2000»

Random graph models for the web graph

14 years 3 months ago

Random graph models for the web graph

Download www.mscs.dal.ca

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Random web crawls

» Protean Graphs with a Variety of Ranking Schemes

» Towards Compressing Web Graphs

» Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces

» The cover time of the preferential attachment graph

» Connectivity threshold and recovery time in rankbased models for complex networks

» Evolution of page popularity under random web graph models

» A Geometric Preferential Attachment Model of Networks II

» Infinite Limits and Adjacency Properties of a Generalized Copying Model

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal

Comments (0)