 |
|
|
|
| HAL: hal-00341523, version 1 |
| DOI: 10.1007/978-3-540-87779-0_16 |
| Detailed view |  Export this paper |
|
|
| DISC 2008, France (2008) |
|
|
|
|
| Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens |
|
|
| Paola Flocchini 1David Ilcinkas 2, 3 |
|
|
| (2008-09) |
|
|
|
| We prove that, for the black hole search problem, the pure token model is computationally as powerful as the whiteboard model; furthermore the complexity is exactly the same. More precisely, we prove that a team of {\em two} asynchronous agents, each endowed with a single identical pebble (that can be placed only on nodes, and with no more than one pebble per node) can locate the black hole in an arbitrary network of known topology; this can be done with $\Theta(n \log n)$ moves, where $n$ is the number of nodes, even when the links are not FIFO. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Distributed Computing Research Group [Ottawa] |
|
|
|
University of Ottawa |
|
|
| 2: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux – Université Victor Segalen - Bordeaux II |
|
|
| 3: | CEPAGE (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – ENSEIRB |
|
|
| 4: | School of Computer Science |
|
|
|
Carleton University |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Distributed, Parallel, and Cluster Computing Computer Science/Data Structures and Algorithms |
|
|
| distributed computing – graph exploration – mobile agents – autonomous robots – dangerous graphs |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00341523, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00341523 | |
| oai:hal.archives-ouvertes.fr:hal-00341523 | |
| From: David Ilcinkas | |
| Submitted on: Tuesday, 25 November 2008 13:37:12 | |
| Updated on: Tuesday, 25 November 2008 14:22:28 | |
