{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:22:59Z","timestamp":1743060179254,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_17","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"186-197","source":"Crossref","is-referenced-by-count":10,"title":["Tight Bounds for Scattered Black Hole Search in a Ring"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Labourel, A., Markou, E.: Tight bounds for black hole search with scattered agents in synchronous rings. ArXiv Preprint (arXiv:1104.5076v1) (2011)","key":"17_CR1","DOI":"10.1007\/978-3-642-22212-2_17"},{"key":"17_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":"17_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":"17_CR4","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., Kralovic, R., Miklik, S., Pardubska, 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":"17_CR5","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., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae\u00a071(2,3), 229\u2013242 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20095","volume":"47","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Optimal search for a black hole in common interconnection networks. Networks\u00a047(2), 61\u201371 (2006)","journal-title":"Networks"},{"unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring a dangerous unknown graph using tokens. In: Proceedings of 5th IFIP International Conference on Theoretical Computer Science, pp. 131\u2013150 (2006)","key":"17_CR7"},{"issue":"1","key":"17_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":"17_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"},{"key":"17_CR10","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., Kralovic, 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)"},{"doi-asserted-by":"crossref","unstructured":"Dobrev, S., Santoro, N., Shi, W.: Scattered black hole search in an oriented ring using tokens. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium, pp. 1\u20138 (2007)","key":"17_CR11","DOI":"10.1109\/IPDPS.2007.370460"},{"issue":"6","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1142\/S0129054108006327","volume":"19","author":"S. Dobrev","year":"2008","unstructured":"Dobrev, S., Santoro, N., Shi, W.: Using scattered mobile agents to locate a black hole in an un-oriened ring with tokens. International Journal of Foundations of Computer Science\u00a019(6), 1355\u20131372 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-87779-0_16","volume-title":"Distributed Computing","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: Optimal black hole search with pure tokens. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 227\u2013241. Springer, Heidelberg (2008)"},{"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: Proceedings of IEEE International Symposium on Parallel & Distributed Processing, pp. 1\u201310 (2009)","key":"17_CR14","DOI":"10.1109\/IPDPS.2009.5161080"},{"issue":"2-3","key":"17_CR15","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 graphs. Theoretical Computer Science\u00a0384(2-3), 201\u2013221 (2007)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Kosowski, A., Navarra, A., Pinotti, C.: Synchronization helps robots to detect black holes in directed graphs. In: Proceedings of 13th International Conference on Principles of Distributed Systems, pp. 86\u201398 (2009)","key":"17_CR16","DOI":"10.1007\/978-3-642-10877-8_9"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-13284-1_13","volume-title":"Structural Information and Communication Complexity","author":"R. Kr\u00e0lovic","year":"2010","unstructured":"Kr\u00e0lovic, R., Mikl\u00eck, S.: Periodic data retrieval problem in rings containing a malicious host. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 156\u2013167. Springer, Heidelberg (2010)"},{"unstructured":"Shannon, C.E.: Presentation of a maze-solving machine. In: Proceedings of 8th Conference of the Josiah Macy Jr. Found (Cybernetics), pp. 173\u2013180 (1951)","key":"17_CR18"},{"key":"17_CR19","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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:14:28Z","timestamp":1741331668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}