{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:14Z","timestamp":1759638794653,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/ipdps.2009.5161080","type":"proceedings-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T15:56:45Z","timestamp":1248105405000},"page":"1-10","source":"Crossref","is-referenced-by-count":22,"title":["Map construction and exploration by mobile agents scattered in a dangerous network"],"prefix":"10.1109","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","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370460"},{"key":"17","first-page":"1","article-title":"cycling through a dangerous network: a simple efficient strategy for black hole search","year":"2006","journal-title":"ICDCS 2006"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/11758471_16"},{"key":"15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","article-title":"mobile search for a black hole in an anonymous ring","volume":"48","author":"dobrev","year":"2007","journal-title":"Algorithmica"},{"key":"16","first-page":"111","article-title":"improved bounds for optimal black hole search with a network map","volume":"3104","author":"dobrev","year":"2004","journal-title":"ser LNCS"},{"key":"13","first-page":"34","article-title":"multiple agents rendezvous in a ring in spite of a black hole","volume":"3144","author":"dobrev","year":"2003","journal-title":"ser LNCS"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0154-y"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/net.20095"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34735-6_14"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1002\/net.20127"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/0207017"},{"key":"23","first-page":"261","article-title":"approximation bounds for black hole search problems","volume":"3974","author":"klasing","year":"2005","journal-title":"ser LNCS"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.024"},{"key":"25","first-page":"243","article-title":"automata and planar graphs","author":"kozen","year":"1979","journal-title":"FCT 1979 Proceedings of the Conference on the Fundamentals of Computation Theory"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1043"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365703"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276759"},{"key":"10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","article-title":"tree exploration with little memory","volume":"51","author":"diks","year":"2004","journal-title":"Journal of Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00054-U"},{"year":"0","key":"7"},{"key":"6","first-page":"320","article-title":"searching for black-hole faults in a network using multiple agents","volume":"4305","author":"cooper","year":"2006","journal-title":"ser LNCS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75142-7_11"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.30"},{"key":"9","first-page":"99","article-title":"distributed exploration of an unknown graph","volume":"3499","author":"das","year":"2005","journal-title":"ser LNCS"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306008133"}],"event":{"name":"Distributed Processing (IPDPS)","start":{"date-parts":[[2009,5,23]]},"location":"Rome, Italy","end":{"date-parts":[[2009,5,29]]}},"container-title":["2009 IEEE International Symposium on Parallel & Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5136864\/5160846\/05161080.pdf?arnumber=5161080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T18:06:50Z","timestamp":1497809210000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5161080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2009.5161080","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}