{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:47Z","timestamp":1770972407708,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819705658","type":"print"},{"value":"9789819705665","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_21","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"288-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Black Hole Search in Dynamic Cactus Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1517-8779","authenticated-orcid":false,"given":"Adri","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9492-9894","authenticated-orcid":false,"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8632-5767","authenticated-orcid":false,"given":"Partha Sarathi","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharya, A., Italiano, G.F., Mandal, P.S.: Black hole search in dynamic cactus graph (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.10984","DOI":"10.1007\/978-981-97-0566-5_21"},{"issue":"2\u20133","key":"21_CR2","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. 71(2\u20133), 229\u2013242 (2006)","journal-title":"Fund. Inform."},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1017\/S0963548306008133","volume":"16","author":"J Czyzowicz","year":"2007","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in synchronous tree networks. Comb. Probab. Comput. 16(4), 595\u2013619 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00446-018-0339-1","volume":"33","author":"G Di Luna","year":"2020","unstructured":"Di Luna, G., Dobrev, S., Flocchini, P., Santoro, N.: Distributed exploration of dynamic rings. Distrib. Comput. 33, 41\u201367 (2020)","journal-title":"Distrib. Comput."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Viglietta, G.: Gathering in dynamic rings. Theor. Comput. Sci. 811, 79\u201398 (2020)","DOI":"10.1016\/j.tcs.2018.10.018"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Flocchini, P., Prencipe, G., Santoro, N.: Black hole search in dynamic rings. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 987\u2013997. IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00098"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distrib. Comput. 19 (2006)","DOI":"10.1007\/s00446-006-0154-y"},{"issue":"06","key":"21_CR8","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-oriented ring with tokens. Int. J. Found. Comput. Sci. 19(06), 1355\u20131372 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR9","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.C., Santoro, N.: Searching for black holes in subways. Theory Comput. Syst. 50, 158\u2013184 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"2\u20133","key":"21_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theor. Comput. Sci. 345(2\u20133), 331\u2013344 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.003","volume":"122","author":"T Gotoh","year":"2021","unstructured":"Gotoh, T., Flocchini, P., Masuzawa, T., Santoro, N.: Exploration of dynamic networks: tight bounds on the number of agents. J. Comput. Syst. Sci. 122, 1\u201318 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2020.11.004","volume":"850","author":"T Gotoh","year":"2021","unstructured":"Gotoh, T., Sudo, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Exploration of dynamic tori by multiple agents. Theor. Comput. Sci. 850, 202\u2013220 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3390\/a13060141","volume":"13","author":"T Gotoh","year":"2020","unstructured":"Gotoh, T., Sudo, Y., Ooshita, F., Masuzawa, T.: Dynamic ring exploration with (h, s) view. Algorithms 13(6), 141 (2020)","journal-title":"Algorithms"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00224-020-10001-0","volume":"65","author":"D Ilcinkas","year":"2021","unstructured":"Ilcinkas, D., Wade, A.M.: Exploration of dynamic cactuses with sub-logarithmic overhead. Theory Comput. Syst. 65, 257\u2013273 (2021)","journal-title":"Theory Comput. Syst."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Markou, E., Paquette, M.: Black hole search and exploration in unoriented tori with synchronous scattered finite automata. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) Principles of Distributed Systems. OPODIS 2012. LNCS, vol. 7702, pp. 239\u2013253. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35476-2_17","DOI":"10.1007\/978-3-642-35476-2_17"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:09:22Z","timestamp":1709654962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}