 |
 |
 |
 |
|
|
|
|
| HAL: hal-00416574, version 1 |
| Detailed view |  Export this paper |
 |
| Journal of Physics A: Mathematical and Theoretical 41, 3 (2008) 035004 |
|
|
|
|
| Vertex labeling and routing in expanded Apollonian networks |
|
|
| Zhongzhi Zhang 1Francesc Comellas 2 |
|
|
| (2008) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Department of Computer Science and Engineering and Shanghai Key Lab of Intelligent Information Processing |
|
|
|
Fudan University |
|
|
| 2: | Dep. de Matem`atica Aplicada IV, EPSC |
|
|
|
Universitat Politécnica de Catalunya |
|
|
| 3: | Laboratoire d'Informatique de Nantes Atlantique (LINA) |
|
|
|
CNRS : UMR6241 – Université de Nantes – École Nationale Supérieure des Mines - Nantes |
|
|
| 4: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 5: | Institute of Systems Engineering |
|
|
|
Dalian University of Technology |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Discrete Mathematics |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00416574, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00416574 | |
| oai:hal.archives-ouvertes.fr:hal-00416574 | |
| From: Guillaume Fertin | |
| Submitted on: Tuesday, 15 September 2009 10:21:47 | |
| Updated on: Tuesday, 15 September 2009 10:23:53 | |
