Name
Abstract | ||
|---|---|---|
The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph has about a billion nodes today, several billion links, and appears to grow exponentially with time. There are many reasons—mathematical, sociological, and commercial—for studying the evolution of this graph. We first review a set of algorithms that operate on the Web graph, addressing problems from Web search, automatic community discovery, and classification. We then recall a number of measurements and properties of the Web graph. Noting that traditional random graph models do not explain these observations, we propose a new family of random graph models. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/335168.335170 | PODS |
Keywords | Field | DocType |
traditional random graph model,billion node,web graph,new family,automatic community discovery,world-wide web,web search,random graph model,billion link,directed graph,world wide web | Graph database,World Wide Web,Random graph,Computer science,Directed graph,Theoretical computer science,Null graph,Hyperlink,Clique-width,Voltage graph,Graph (abstract data type) | Conference |
ISBN | Citations | PageRank |
1-58113-214-X | 122 | 151.99 |
References | Authors | |
21 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ravi Kumar | 1 | 13932 | 1642.48 |
| Prabhakar Raghavan | 2 | 13351 | 2776.61 |
| Sridhar Rajagopalan | 3 | 4527 | 1036.34 |
| D. Sivakumar | 4 | 3515 | 389.02 |
| Andrew Tompkins | 5 | 122 | 151.99 |
| Eli Upfal | 6 | 4310 | 743.13 |