Vertex labeling and routing in expanded Apollonian networks

Abstract : We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their nodes that allows one to determine a shortest path routing between any two nodes of the network based only on the labels.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00416574
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, September 15, 2009 - 10:21:47 AM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Document(s) archivé(s) le : Tuesday, October 16, 2012 - 10:55:15 AM

File

LabelingApollonian.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00416574, version 1

Citation

Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, André Raspaud, Lili Rong, et al.. Vertex labeling and routing in expanded Apollonian networks. Journal of Physics A: Mathematical and Theoretical, IOP Publishing, 2008, 41 (3), pp.035004. ⟨hal-00416574⟩

Share

Metrics

Record views

394

Files downloads

149