Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Networks
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Searching for a Black Hole in Synchronous Tree Networks¶
Combinatorics, Probability and Computing
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Journal of Graph Theory
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximation bounds for black hole search problems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Black Hole Search with Tokens in Interconnected Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Tight bounds for scattered black hole search in a ring
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
| Hi-index | 0.01 |
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 twoasynchronous 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 茂戮驴(nlogn) moves, where nis the number of nodes, even when the links are not FIFO.