Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

Autor
Comellas, F.; Miralles, A.
Tipus d'activitat
Article en revista
Revista
Journal of physics A. Mathematical and theoretical
Data de publicació
2009-10
Volum
42
Número
42
Pàgina inicial
5001
DOI
https://doi.org/10.1088/1751-8113/42/42/425001 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/3048 Obrir en finestra nova
URL
http://www.iop.org/EJ/toc/1751-8113/42/42 Obrir en finestra nova
Resum
Es publicarà a Journal of Physics A: Mathematical and Theoretical 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...
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius