Crawling on web graphs

DOI10.1145/509907.509970MaRDI QIDQ3579239zbMATH OpenOpenAlexFDO

Authors Colin Cooper, Alan Frieze

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509970

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cited in

(4)

• A general model of web graphs
• Memory Efficient Anonymous Graph Exploration
• On certain connectivity properties of the internet topology
• Social networks spread rumors in sublogarithmic time

This page was built for publication: Crawling on web graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579239)