Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/3048
Tipus de documentArticle
Data publicació2009-07
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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.
Descripció
Es publicarà a Journal of Physics A: Mathematical and Theoretical
Citació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.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
CoMi09-JPhysA-rev2sub.pdf | 189,7Kb | Visualitza/Obre |