{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:20Z","timestamp":1759639040796},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335358"},{"type":"electronic","value":"9783642335365"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33536-5_30","type":"book-chapter","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T11:52:35Z","timestamp":1349005955000},"page":"299-313","source":"Crossref","is-referenced-by-count":3,"title":["Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents"],"prefix":"10.1007","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Kellett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter C.","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-17461-2_5","volume-title":"Combinatorial Optimization and Applications","author":"B. Balamohan","year":"2010","unstructured":"Balamohan, B., Flocchini, P., Miri, A., Santoro, N.: Time Optimal Algorithms for Black Hole Search in Rings. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 58\u201371. Springer, Heidelberg (2010)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-22212-2_18","volume-title":"Structural Information and Communication Complexity","author":"B. Balamohan","year":"2011","unstructured":"Balamohan, B., Flocchini, P., Miri, A., Santoro, N.: Improving the Optimal Bounds for Black Hole Search in Rings. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 198\u2013209. Springer, Heidelberg (2011)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-22212-2_17","volume-title":"Structural Information and Communication Complexity","author":"J. Chalopin","year":"2011","unstructured":"Chalopin, J., Das, S., Labourel, A., Markou, E.: Tight Bounds for Scattered Black Hole Search in a Ring. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 186\u2013197. Springer, Heidelberg (2011)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-75142-7_11","volume-title":"Distributed Computing","author":"J. Chalopin","year":"2007","unstructured":"Chalopin, J., Das, S., Santoro, N.: Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 108\u2013122. Springer, Heidelberg (2007)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11945529_23","volume-title":"Principles of Distributed Systems","author":"C. Cooper","year":"2006","unstructured":"Cooper, C., Klasing, R., Radzik, T.: Searching for Black-Hole Faults in a Network Using Multiple Agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 320\u2013332. Springer, Heidelberg (2006)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-11476-2_15","volume-title":"Structural Information and Communication Complexity","author":"J. Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., Dobrev, S., Kr\u00e1lovi\u010d, R., Mikl\u00edk, S., Pardubsk\u00e1, D.: Black Hole Search in Directed Graphs. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 182\u2013194. Springer, Heidelberg (2010)"},{"issue":"2,3","key":"30_CR7","first-page":"229","volume":"71","author":"J. Czyzowicz","year":"2006","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fund. Inform.\u00a071(2,3), 229\u2013242 (2006)","journal-title":"Fund. Inform."},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20095","volume":"47","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Kr\u00e1lovi\u010d, R., Ru\u017ei\u010dka, P., Prencipe, G., Santoro, N.: Black hole search in common interconnection networks. Networks\u00a047(2), 61\u201371 (2006)","journal-title":"Networks"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-006-0154-y","volume":"19","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: Optimal mobile agents protocols. Distrib. Comput.\u00a019(1), 1\u201319 (2006)","journal-title":"Distrib. Comput."},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","volume":"48","author":"S. Dobrev","year":"2007","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica\u00a048(1), 67\u201390 (2007)","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/s00453-011-9496-3","volume":"62","author":"P. Flocchini","year":"2012","unstructured":"Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: Optimal black hole search with pebbles. Algorithmica\u00a062(3\u20134), 1006\u20131033 (2012)","journal-title":"Algorithmica"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Map construction and exploration by mobile agents scattered in a dangerous network. In: Proceedings of IPDPS (2009)","DOI":"10.1109\/IPDPS.2009.5161080"},{"issue":"1","key":"30_CR13","first-page":"158","volume":"50","author":"P. Flocchini","year":"2012","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Searching for black holes in subways. Theory Comput.\u00a050(1), 158\u2013184 (2012)","journal-title":"Theory Comput."},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-05434-1_13","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"P. Glaus","year":"2009","unstructured":"Glaus, P.: Locating a Black Hole without the Knowledge of Incoming Link. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 128\u2013138. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"30_CR15","first-page":"201","volume":"384","author":"R. Klasing","year":"2007","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Comput. Sci.\u00a0384(2-3), 201\u2013221 (2007)","journal-title":"Comput. Sci."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20233","volume":"52","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for black hole search problems. Networks\u00a052(4), 216\u2013226 (2008)","journal-title":"Networks"},{"issue":"41","key":"30_CR17","doi-asserted-by":"publisher","first-page":"5752","DOI":"10.1016\/j.tcs.2011.05.054","volume":"412","author":"A. Kosowski","year":"2011","unstructured":"Kosowski, A., Navarra, A., Pinotti, C.M.: Synchronous black hole search in directed graphs. Theor. Comput. Sci.\u00a0412(41), 5752\u20135759 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-13284-1_13","volume-title":"Structural Information and Communication Complexity","author":"R. Kr\u00e1lovi\u010d","year":"2010","unstructured":"Kr\u00e1lovi\u010d, R., Mikl\u00edk, S.: Periodic Data Retrieval Problem in Rings Containing a Malicious Host. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 157\u2013167. Springer, Heidelberg (2010)"},{"key":"30_CR19","unstructured":"Mikl\u00edk, S.: Exploration in faulty networks. Ph.d. thesis, Faculty of Mathematics, Physics, and Informaticcs, Comenius University, Bratislava, Slovakia (2010)"},{"key":"30_CR20","unstructured":"Shannon, C.: Presentation of a maze-solving machine. In: Proceedings of the 8th Conference of the Josiah Macy Jr. Foundation (Cybernetics), pp. 173\u2013180 (1951)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-642-05118-0_46","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"W. Shi","year":"2009","unstructured":"Shi, W.: Black Hole Search with Tokens in Interconnected Networks. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 670\u2013682. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33536-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:14:41Z","timestamp":1620130481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33536-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335358","9783642335365"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33536-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}