Author:
Bampas Evangelos,Leonardos Nikos,Markou Euripides,Pagourtzis Aris,Petrolia Matoula
Publisher
Springer International Publishing
Reference23 articles.
1. Lecture Notes in Computer Science;B. Balamohan,2012
2. Balamohan, B., Flocchini, P., Miri, A., Santoro, N.: Time optimal algorithms for black hole search in rings. Discrete Math., Alg. and Appl. 3(4), 457–472 (2011)
3. Lecture Notes in Computer Science;J. Chalopin,2007
4. Czyzowicz, J., Dobrev, S., Gąsieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, I., Martin, R., Sadakane, K., Sung, W.K.: More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444, 60–76 (2012)
5. Dobrev, S., Flocchini, P., Královič, R., Ruzicka, P., Prencipe, G., Santoro, N.: Black hole search in common interconnection networks. Networks 47(2), 61–71 (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faulty Node Repair and Dynamically Spawned Black Hole Search;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2017
2. Mobile Agents Rendezvous in Spite of a Malicious Agent;Algorithms for Sensor Systems;2015