Bounded expansion in web graphs
Commentationes Mathematicae Universitatis Carolinae, Tome 50 (2009) no. 2, pp. 181-190
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Classification :
05C83, 90B10, 90B15, 94C15
Keywords: graph minors; bounded expansion; webgraphs
Keywords: graph minors; bounded expansion; webgraphs
@article{CMUC_2009_50_2_a1,
author = {Gago, Silvia and Schlatter, Dirk},
title = {Bounded expansion in web graphs},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {181--190},
year = {2009},
volume = {50},
number = {2},
mrnumber = {2537830},
zbl = {1212.05248},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_2009_50_2_a1/}
}
Gago, Silvia; Schlatter, Dirk. Bounded expansion in web graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 50 (2009) no. 2, pp. 181-190. http://geodesic.mathdoc.fr/item/CMUC_2009_50_2_a1/