Complexity of Searching for a Black Hole

@article{Czyzowicz2006ComplexityOS,
  title={Complexity of Searching for a Black Hole},
  author={Jurek Czyzowicz and Dariusz R. Kowalski and Euripides Markou and Andrzej Pelc},
  journal={Fundam. Inform.},
  year={2006},
  volume={71},
  pages={229-242}
}
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without lea ving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents c apable to identify a black hole is two. For a given graph and given starting node we are interest d in the fastest possible black hole search by two… CONTINUE READING