{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:39Z","timestamp":1742912859166,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_18","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"198-209","source":"Crossref","is-referenced-by-count":6,"title":["Improving the Optimal Bounds for Black Hole Search in Rings"],"prefix":"10.1007","author":[{"given":"Balasingham","family":"Balamohan","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Miri","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_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":"18_CR2","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":"18_CR3","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":"18_CR4","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1016\/j.tcs.2010.01.011","volume":"411","author":"C. Cooper","year":"2010","unstructured":"Cooper, C., Klasing, R., Radzik, T.: Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci.\u00a0411, 1638\u20131647 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"18_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\u00e1lovic, 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":"18_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.3233\/FUN-2006-712-305","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"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1017\/S0963548306008133","volume":"16","author":"J. Czyzowicz","year":"2007","unstructured":"Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Searching for a black hole in synchronous tree networks. Comb. Prob. & Comp.\u00a016(4), 595\u2013619 (2007)","journal-title":"Comb. Prob. & Comp."},{"issue":"2","key":"18_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\u00e1lovic, R., Ruzicka, P., Prencipe, G., Santoro, N.: Black hole search in common interconnection networks. Networks\u00a047(2), 61\u201371 (2006)","journal-title":"Networks"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Kr\u00e1lovic, R., Santoro, N.: Exploring an unknown graph to locate a black hole using tokens. In: 5th IFIP Int. Conference on Theoretical Computer Science (TCS), pp. 131\u2013150 (2006)","DOI":"10.1007\/978-0-387-34735-6_14"},{"issue":"1","key":"18_CR10","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":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-27796-5_11","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search with a network map. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 111\u2013122. Springer, Heidelberg (2004)"},{"key":"18_CR12","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., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica\u00a048, 67\u201390 (2007)","journal-title":"Algorithmica"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11758471_16","volume-title":"Algorithms and Complexity","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Kr\u00e1lovic, R., Santoro, N., Shi, W.: Black hole search in asynchronous rings using tokens. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 139\u2013150. Springer, Heidelberg (2006)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: optimal black hole search with pebbles. Algorithmica (2011)","DOI":"10.1007\/s00453-011-9496-3"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Map construction and exploration by mobile agents scattered in a dangerous network. In: 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201310 (2009)","DOI":"10.1109\/IPDPS.2009.5161080"},{"key":"18_CR16","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":"18_CR17","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":"18_CR18","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"},{"key":"18_CR19","series-title":"LNCS","first-page":"86","volume-title":"OPODIS 2009","author":"A. Kosowski","year":"2009","unstructured":"Kosowski, A., Navarra, A., Pinotti, C.M.: Synchronization helps robots to detect black holes in directed graphs. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 86\u201398. Springer, Heidelberg (2009)"},{"key":"18_CR20","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\u00e1lovic","year":"2010","unstructured":"Kr\u00e1lovic, 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":"18_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","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:14:20Z","timestamp":1741331660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}