Bounded expansion in web graphs.

MaRDI QIDQ3057276zbMATH OpenFDO

Authors Silvia Gago, Dirk Schlatter

Publication date 24 November 2010

Full work available at URL https://eudml.org/doc/32492, http://www.emis.de/journals/CMUC/cmuc0902/cmuc0902.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

bounded expansiongraph minorwebgraph

Mathematics Subject Classification ID

Graph minors (05C83) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A Geometric Preferential Attachment Model of Networks II
• A general model of web graphs
• Isomorphism and embedding problems for infinite limits of scale-free graphs
• Infinite Limits of Copying Models of the Web Graph
• A course on the web graph

Cited in

(1)

• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs

This page was built for publication: Bounded expansion in web graphs.

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