The Web as a graph
Summary: Models the WWW as a massive directed graph (~10^9 nodes), surveys graph algorithms for search, community discovery, and classification, and reports key empirical measurements. Introduces a new family of random-graph models to explain Web-specific properties not captured by classical models. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ravi Kumar (IBM)
- 2. Prabhakar Raghavan (IBM)
- 3. Andrew Tomkins (IBM)
- 4. Sridhar Rajagopalan (IBM)
- 5. Eli Upfal (Brown University)
- 6. D. Sivakumar (IBM)
BibTeX Citation
@inproceedings{kumar_pods00,
address = {New York, NY, USA},
series = {{PODS} '00},
title = {{The Web as a graph}},
url = {https://dl.acm.org/doi/10.1145/335168.335170},
doi = {10.1145/335168.335170},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kumar, Ravi and Raghavan, Prabhakar and Tomkins, Andrew and Rajagopalan, Sridhar and Upfal, Eli and Sivakumar, D.},
year = {2000}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,119 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB | 7.7370163e-05 |
| 4,178 | A Web Odyssey: from Codd to XML | 2001 | PODS | 6.849218e-05 |
| 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 5.9336489e-05 |
| 8,822 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD | 5.3624668e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD |
| 2 | 1,958 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB |
| 3 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 4 | 12,762 | Using Non-Linear Dynamical Systems for Web Searching and Ranking | 2004 | PODS |
| 5 | 1,396 | Estimating PageRank on Graph Streams | 2008 | PODS |
| 6 | 8,054 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB |
| 7 | 5,980 | Extracting large-scale knowledge bases from the web | 1999 | VLDB |
| 8 | 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB |
| 9 | 12,862 | Self-similarity in the web | 2001 | VLDB |
| 10 | 12,680 | Evolution of Page Popularity under Random Web Graph Models | 2006 | PODS |