Abstract
Consider a team of (one or more) mobile agents operating in a graph G. Unaware of the graph topology and starting from the same node, the team must explore the graph. This problem, known as graph exploration, was initially formulated by Shannon in 1951, and has been extensively studied since under a variety of conditions. The existing investigations have all assumed that the network is safe for the agents, and the solutions presented in the literature succeed in their task only under this assumption.
Recently, the exploration problem has been examined also when the network is unsafe. The danger examined is the presence in the network of a black hole, a node that disposes of any incoming agent without leaving any observable trace of this destruction. The goal is for at least one agent to survive and to have all the surviving agents to construct a map of the network, indicating the edges leading to the black hole. This variant of the problem is also known as black hole search. This problem has been investigated assuming powerful inter-agent communication mechanisms: whiteboards at all nodes. Indeed, in this model, the black hole search problem can be solved with a minimal team size and performing a polynomial number of moves.
In this paper, we consider a less powerful token model. We constructively prove that the black hole search problem can be solved also in this model; furthermore, this can be done using a minimal team size and performing a polynomial number of moves. Our algorithm works even if the agents are asynchronous and if both the agents and the nodes are anonymous.
Partially supported by grant VEGA 1/3106/06.
Please use the following format when citing this chapter: Dobrev, S., Flocchini, P,. Královič, Santoro, N., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 131–150.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Averbakh and O. Berman. A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discr. Appl. Math., 68:17–32, 1996.
M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proe. 30th ACM Symp. on Theory of Computing (STOC’98), 269–287, 1998.
M. Bender and D. K. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. In Proc. 35th Syrup. on Foundations of Computer Science (FOCS’94), 75–85, 1994.
M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In 19th Symposium on Foundations of Computer Science (FOCS’78), 132–142, 1978.
J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), 35–45, 2004.
S. Das, P. Flocchini, A. Nayak, and N. Santoro. Exploration and labelling of an unknown graph by multiple agents. In Proc. 12th Int. Coll. on Structural Information and Communication Complexity (SIROCCO’05), 99–114, 2005.
X. Deng and C. H. Papadimitriou. Exploring an unknown graph. Journal of Graph Theory, 32(3):265–297, 1999.
S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Optimal search for a black hole in common interconnection networks. Networks, 47(2):61–71, 2006.
S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile search for a black hole in an anonymous ring. Algorithmiea. To appear.
S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Computing. To appear.
S. Dobrev, P. Flocchini, and N. Santoro. Improved bounds for optimal black hole search in a network with a map. In Proc. of 10th Int. Coll. on Structural Information and Communication Complexity (SIROCCO’04), 111–122, 2004.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. Transactions on Robotics and Automation, 7(6):859–865, 1991.
P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc. Collective tree exploration. In 6th Latin American Theoretical Informatics Symp. (LATIN’04), 141–151, 2004.
P. Praigniaud and D. Ilcinkas. Digraph exploration with little memory. In 21st Syrup. on Theoretical Aspects of Computer Science (STACS—’04), 246–257, 2004.
G. N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation algorithms for some routing problems. SIAM J. on Computing, 7:178–193, 1978.
R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO—05), 200–215, 2005.
R. Oppliger. Security issues related to mobile code and agent-based systems. Computer Communications, 22(12):1165–1170, 1999.
P. Panaite and A. Pelc. Exploring unknown undirected graphs. J. Algorithms, 33:281–295, 1999.
CL. E. Shannon. Presentation of a maze-solving machine. In 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), 173–180, 1951.
Jan Vitek and Giuseppe Castagna. Mobile computations and hostile hosts. In D. Tsichritzis, editor, Mobile Objects, 241–261, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Dobrev, S., Flocchini, P., Královič, R., Santoro, N. (2006). Exploring an Unknown Graph to Locate a Black Hole Using Tokens. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)