The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
An Efficient Method for Generating Discrete Random Variables with General Distributions
ACM Transactions on Mathematical Software (TOMS)
Proceedings of the 27th International Conference on Very Large Data Bases
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Autonomic Web-Based Simulation
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
The Web as a graph: How far we are
ACM Transactions on Internet Technology (TOIT)
Map of nonprofit organization websites in Israel
Journal of the American Society for Information Science and Technology
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
| Hi-index | 0.00 |
The Webgraph is a diagram produced by the World Wide Web's hyperlinked structure: its nodes are static HTML pages, and its edges are the hyperlinks between two pages. Since the early '90s, the Web has grown exponentially a trend we expect will continue. Today's Webgraph has several billion edges, but in spite of its size, it exhibits a well-defined structure characterized by several properties. In the past few years, several research papers have reported these properties and proposed various random graph models.1 We simulated several of these models and compared them against a 300-million-node sample of the Webgraph provided by the Stanford WebBase project (http://www-diglib.stanford.edu/~testbed/doc2/WebBase/). All the software we developed to perform this comparison is free to download from the European Research Project COSIN Web site (www.cosin.org).