×

The Erdős Webgraph Server. (English) Zbl 1284.05322

Summary: We describe the new Erdős Webgraph Server, paying tribute to Paul Erdős, deceased 17 years ago. The server is publicly available at http://web-graph.org. Much work has been done on webgraphs, but by the best of our knowledge, there is no other regularly refreshed, freely available webgraph on the net: the freshest we are aware of is two years old. Here the crawling process and the graph building strategy of the server is detailed.

MSC:

05C99 Graph theory
05C90 Applications of graph theory
68M11 Internet topics
68R10 Graph theory (including graph drawing) in computer science
68U35 Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)

Keywords:

webgraph
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Barabási, Albert-László; Albert, Réka, Emergence of scaling in random networks, Science, 286, 5439, 509-512 (1999) · Zbl 1226.05223
[2] Brin, Sergey; Page, Lawrence, The anatomy of a large-scale hypertextual web search engine, Computer Networks and ISDN Systems, 30, 107-117 (1998)
[4] Chakrabarti, Soumen; Dom, Byron E.; Ravi Kumar, S.; Raghavan, Prabhakar; Rajagopalan, Sridhar; Tomkins, Andrew; Gibson, David; Kleinberg, Jon, Mining the Web’s link structure, Computer, 32, 8, 60-67 (1999)
[6] Dean, Jeffrey; Henzinger, Monika R., Finding related pages in the world wide web, Computer Networks, 31, 1467-1479 (1999)
[7] Haveliwala, Taher H.; Gionis, Aristides; Klein, Dan; Indyk, Piotr, Evaluating strategies for similarity search on the web, (Proceedings of the 11th International Conference on World Wide Web. Proceedings of the 11th International Conference on World Wide Web, WWW’02 (2002), ACM: ACM New York, NY, USA), 432-442
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.