{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:22Z","timestamp":1725466342427},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_24","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"279-290","source":"Crossref","is-referenced-by-count":7,"title":["Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles"],"prefix":"10.1007","author":[{"given":"Balasingham","family":"Balamohan","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-24100-0_41","volume-title":"Distributed Computing","author":"J. Chalopin","year":"2011","unstructured":"Chalopin, J., Das, S., Labourel, A., Markou, E.: Black Hole Search with Finite Automata Scattered in a Synchronous Torus. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 432\u2013446. Springer, Heidelberg (2011)"},{"key":"24_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":"24_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":"24_CR5","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":"24_CR6","first-page":"229","volume":"71","author":"J. Czyzowicz","year":"2006","unstructured":"Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae\u00a071(2-3), 229\u2013242 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"24_CR7","series-title":"IFIP","first-page":"131","volume-title":"TCS 2006","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Kr\u00e1lovic, R., Santoro, N.: Exploring an Unknown Graph to Locate a Black Hole Using Tokens. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) TCS 2006. IFIP, vol.\u00a0209, pp. 131\u2013150. Springer, Boston (2006)"},{"issue":"1","key":"24_CR8","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. Distributed Computing\u00a019(1), 1\u201319 (2006)","journal-title":"Distributed Computing"},{"key":"24_CR9","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, 67\u201390 (2007)","journal-title":"Algorithmica"},{"issue":"3-4","key":"24_CR10","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-4), 1006\u20131033 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00224-011-9341-8","volume":"50","author":"P. Flocchini","year":"2012","unstructured":"Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Searching for black holes in subways. Theory of Computing Systems\u00a050(1), 158\u2013184 (2012)","journal-title":"Theory of Computing Systems"},{"issue":"2-3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2007.04.024","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. Theoretical Computer Science\u00a0384(2-3), 201\u2013221 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"24_CR13","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":"24_CR14","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. Theoretical Computer Science\u00a0412(41), 5752\u20135759 (2011)","journal-title":"Theoretical Computer Science"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Shi, W.: Black hole search with tokens in interconnected networks. In: 11th Int. Symp. on Stabilization, Safety, and Security of Distr. Sys (SSS), pp. 670\u2013682 (2009)","DOI":"10.1007\/978-3-642-05118-0_46"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:58Z","timestamp":1620128698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}