Mostra el registre d'ítem simple
Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
dc.contributor.author | Comellas Padró, Francesc de Paula |
dc.contributor.author | Miralles de la Asunción, Alicia |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2009-09-01T12:28:47Z |
dc.date.available | 2009-09-01T12:28:47Z |
dc.date.issued | 2009-07 |
dc.identifier.citation | Comellas Padró, F. de P.; Miralles de la Asunción, A. Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks. "Journal of physics A. Mathematical and theoretical", Juliol 2009, vol. 42, núm. 42, p. 5001. |
dc.identifier.uri | http://hdl.handle.net/2117/3048 |
dc.description | Es publicarà a Journal of Physics A: Mathematical and Theoretical |
dc.description.abstract | This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with a low clustering, like the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization) and also to understand the underlying mechanisms that have shaped their particular structures. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Graph Theory |
dc.subject.lcsh | Combinatorics |
dc.subject.lcsh | Network analysis (Planning) |
dc.subject.other | complex networks |
dc.subject.other | routing |
dc.title | Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks |
dc.type | Article |
dc.subject.lemac | Combinacions (Matemàtica) |
dc.subject.lemac | Anàlisi de xarxes (Planificació) |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | AMS::05 Combinatorics |
dc.subject.ams | AMS::94 Information And Communication, Circuits::94C Circuits, networks |
dc.rights.access | Open Access |
local.identifier.drac | 1602003 |
local.citation.publicationName | Journal of physics A. Mathematical and theoretical |
local.citation.volume | 42 |
local.citation.number | 42 |
local.citation.startingPage | 5001 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.269]
-
Articles de revista [290]