Mostra el registre d'ítem simple

dc.contributor.authorGago Álvarez, Silvia
dc.contributor.authorSchlatter, Dirk
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2007-10-02T16:20:21Z
dc.date.available2007-10-02T16:20:21Z
dc.date.issued2007-10-02
dc.identifier.urihttp://hdl.handle.net/2117/1213
dc.description.abstractWe study the bounded expansion of several models of web graphs. We show that various deterministic graph models for large complex networks have constant bounded expansion.We study two random models of webgraphs, showing that the model of Bonato has not bounded expansion, and we conjecture that the classical model of Barabási may have also not bounded expansion.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.lcshCombinatorics
dc.subject.lcshGraph theory
dc.subject.lcshComputer science
dc.subject.lcshProbability
dc.subject.otherbounded expansion
dc.subject.othergrad
dc.subject.otherwebgraphs
dc.subject.otherminor closed class
dc.subject.otherrandom graphs
dc.titleBounded expansion in models of webgraphs
dc.typeArticle
dc.subject.lemacCombinacions (Matemàtica)
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacInformàtica--Matemàtica
dc.subject.lemacProbabilitats
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::05 Combinatorics
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.subject.amsClassificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science
dc.subject.amsClassificació AMS::60 Probability theory and stochastic processes::60C05 Combinatorial probability
dc.rights.accessOpen Access
local.personalitzacitaciotrue


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple