{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:09Z","timestamp":1725475689757},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34735-6_14","type":"book-chapter","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T18:32:32Z","timestamp":1166121152000},"page":"131-150","source":"Crossref","is-referenced-by-count":11,"title":["Exploring an Unknown Graph to Locate a Black Hole Using Tokens"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I. Averbakh","year":"1996","unstructured":"I. Averbakh and O. Berman. A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discr. Appl. Math., 68:17\u201332, 1996.","journal-title":"Discr. Appl. Math."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proe. 30th ACM Symp. on Theory of Computing (STOC\u201998), 269\u2013287, 1998.","DOI":"10.1145\/276698.276759"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"M. Bender and D. K. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. In Proc. 35th Syrup. on Foundations of Computer Science (FOCS\u201994), 75\u201385, 1994.","DOI":"10.1109\/SFCS.1994.365703"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In 19th Symposium on Foundations of Computer Science (FOCS\u201978), 132\u2013142, 1978.","DOI":"10.1109\/SFCS.1978.30"},{"key":"14_CR5","unstructured":"J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), 35\u201345, 2004."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"S. Das, P. Flocchini, A. Nayak, and N. Santoro. Exploration and labelling of an unknown graph by multiple agents. In Proc. 12th Int. Coll. on Structural Information and Communication Complexity (SIROCCO\u201905), 99\u2013114, 2005.","DOI":"10.1007\/11429647_10"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"X. Deng and C. H. Papadimitriou. Exploring an unknown graph. Journal of Graph Theory, 32(3):265\u2013297, 1999.","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20095","volume":"47","author":"S. Dobrev","year":"2006","unstructured":"S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Optimal search for a black hole in common interconnection networks. Networks, 47(2):61\u201371, 2006.","journal-title":"Networks"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile search for a black hole in an anonymous ring. Algorithmiea. To appear.","DOI":"10.1007\/3-540-45414-4_12"},{"key":"14_CR10","unstructured":"S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Computing. To appear."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"S. Dobrev, P. Flocchini, and N. Santoro. Improved bounds for optimal black hole search in a network with a map. In Proc. of 10th Int. Coll. on Structural Information and Communication Complexity (SIROCCO\u201904), 111\u2013122, 2004.","DOI":"10.1007\/978-3-540-27796-5_11"},{"issue":"6","key":"14_CR12","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/70.105395","volume":"7","author":"G. Dudek","year":"1991","unstructured":"G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. Transactions on Robotics and Automation, 7(6):859\u2013865, 1991.","journal-title":"Transactions on Robotics and Automation"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc. Collective tree exploration. In 6th Latin American Theoretical Informatics Symp. (LATIN\u201904), 141\u2013151, 2004.","DOI":"10.1007\/978-3-540-24698-5_18"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"P. Praigniaud and D. Ilcinkas. Digraph exploration with little memory. In 21st Syrup. on Theoretical Aspects of Computer Science (STACS\u2014\u201904), 246\u2013257, 2004.","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. N. Frederickson","year":"1978","unstructured":"G. N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation algorithms for some routing problems. SIAM J. on Computing, 7:178\u2013193, 1978.","journal-title":"SIAM J. on Computing"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO\u201405), 200\u2013215, 2005.","DOI":"10.1007\/11429647_17"},{"issue":"12","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/S0140-3664(99)00083-3","volume":"22","author":"R. Oppliger","year":"1999","unstructured":"R. Oppliger. Security issues related to mobile code and agent-based systems. Computer Communications, 22(12):1165\u20131170, 1999.","journal-title":"Computer Communications"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"P. Panaite and A. Pelc. Exploring unknown undirected graphs. J. Algorithms, 33:281\u2013295, 1999.","journal-title":"J. Algorithms"},{"key":"14_CR19","unstructured":"CL. E. Shannon. Presentation of a maze-solving machine. In 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), 173\u2013180, 1951."},{"key":"14_CR20","unstructured":"Jan Vitek and Giuseppe Castagna. Mobile computations and hostile hosts. In D. Tsichritzis, editor, Mobile Objects, 241\u2013261, 1999."}],"container-title":["IFIP International Federation for Information Processing","Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34735-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:50:25Z","timestamp":1619574625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34735-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346335"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34735-6_14","relation":{},"subject":[]}}