 |
Université de Provence - Aix-Marseille I Hyper Articles en Ligne |
 |
|
Université de Provence - Aix-Marseille I Hyper Articles en Ligne |
|
| HAL : hal-00695944, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| Distributed Computing 25, 4 (2012) 297-311 |
|
|
|
|
| Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing Systems |
|
|
| Jérémie Chalopin 1Emmanuel Godard 1 |
|
|
| (10/07/2012) |
|
|
|
| This paper attempts to find an answer to an open question of Angluin in her seminal paper (Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82-93 (1980)) about the election problem for families of graphs (Section 4, page 87). More precisely, we characterize families of (labelled) graphs which admit an election algorithm in the message passing model by using the notion of quasi-coverings which captures ''the existence of large enough area of one graph that looks locally like another graph''. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
| 2 : | 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 |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Calcul parallèle, distribué et partagé |
|
|
| Election algorithm for families of graphs – covering – quasi-covering |
|
| hal-00695944, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00695944 | |
| oai:hal.archives-ouvertes.fr:hal-00695944 | |
| Contributeur : Yves Métivier | |
| Soumis le : Jeudi 10 Mai 2012, 12:15:58 | |
| Dernière modification le : Lundi 9 Juillet 2012, 09:12:08 | |
