{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:10:20Z","timestamp":1736284220332,"version":"3.32.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T00:00:00Z","timestamp":1140480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,8,23]]},"DOI":"10.1007\/s00446-006-0154-y","type":"journal-article","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T03:43:11Z","timestamp":1140493391000},"page":"1-99999","source":"Crossref","is-referenced-by-count":59,"title":["Searching for a black hole in arbitrary networks: optimal mobile agents protocols"],"prefix":"10.1007","volume":"19","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,21]]},"reference":[{"key":"154_CR1","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29, 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"154_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"S. Alpern","year":"1999","unstructured":"Alpern, S., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab. 36(1), 223\u2013231 (1999)","journal-title":"J. Appl. Probab."},{"key":"154_CR3","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer (2003)"},{"key":"154_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I. Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discrete Appl. Math. 68, 17\u201332 (1996)","journal-title":"Discrete Appl. Math."},{"key":"154_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Singh, M.: Piecemeal graph learning by a mobile robot. Inf. Comput. 152, 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"154_CR6","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory Comput. Syst. (in press)","DOI":"10.1007\/s00224-005-1223-5"},{"key":"154_CR7","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pp. 324\u2013332 (2002)","DOI":"10.1145\/564870.564906"},{"key":"154_CR8","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA'03), pp. 200\u2013209 (2003)","DOI":"10.1145\/777412.777469"},{"key":"154_CR9","doi-asserted-by":"crossref","unstructured":"Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC'98), pp. 269\u2013287 (1998)","DOI":"10.1145\/276698.276759"},{"key":"154_CR10","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.K.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of the 35th Symposium on Foundations of Computer Science (FOCS'94), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"154_CR11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26, 110\u2013137 (1997)","journal-title":"SIAM J. Comput."},{"key":"154_CR12","doi-asserted-by":"crossref","unstructured":"Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Proceedings of the 19th Symposium on Foundations of Computer Science (FOCS'78), pp. 132\u2013142 (1978)","DOI":"10.1109\/SFCS.1978.30"},{"key":"154_CR13","doi-asserted-by":"crossref","unstructured":"Chess, D.M.: Security issues in mobile code systems. In: Proceedings of the Conference on Mobile Agent Security, LNCS 1419, pp. 1\u201314 (1998)","DOI":"10.1007\/3-540-68671-1_1"},{"key":"154_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment i: The rectilinear case. J. ACM 45, 215\u2013245 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"154_CR15","doi-asserted-by":"crossref","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":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory 32(3), 265\u2013297 (1999)","journal-title":"J. Graph Theory"},{"key":"154_CR16","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic rendezvous in graphs. In: Proceedings of the 11th European Symposium on Algorithms (ESA'03), pp. 184\u2013195 (2003)","DOI":"10.1007\/978-3-540-39658-1_19"},{"key":"154_CR17","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. In: Proceedings of the 10th European Symposium on Algorithms (ESA'02), pp. 374\u2013386 (2002)","DOI":"10.1007\/3-540-45749-6_35"},{"key":"154_CR18","doi-asserted-by":"crossref","unstructured":"Deugo, D.: Mobile agents for electing a leader. In: Proceedings of the 4th International Symposium on Autonomous Decentralized System, pp. 324\u2013324 (1999)","DOI":"10.1109\/ISADS.1999.838454"},{"key":"154_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K. Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. J. Algorith. 51, 38\u201363 (2004)","journal-title":"J. Algorith."},{"key":"154_CR20","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica (in press)"},{"key":"154_CR21","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), pp. 153\u2013162 (2002)","DOI":"10.1145\/571850.571853"},{"issue":"6","key":"154_CR22","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/70.105395","volume":"7","author":"G. Dudek","year":"1991","unstructured":"Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: Robotic exploration as graph construction. Trans. Robot. Autom. 7(6), 859\u2013865 (1991)","journal-title":"Trans. Robot. Autom."},{"key":"154_CR23","doi-asserted-by":"crossref","unstructured":"Esparza, O., Soriano, M., Munoz, J.J., Forne, J.: Host revocation authority: A way of protecting mobile agents from malicious hosts. In: Proceedings of the International Conference onWeb Engineering (ICWE'03), LNCS 2722 (2003)","DOI":"10.1007\/3-540-45068-8_54"},{"issue":"3","key":"154_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I","volume":"32","author":"P. Flocchini","year":"1998","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks 32(3), 165\u2013180 (1998)","journal-title":"Networks"},{"key":"154_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(01)00395-4","volume":"291","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction in distributed computing. Theor. Comput. Sci. (291), 29\u201353 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"154_CR26","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/S0097539700377293","volume":"32","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Roncato, A., Santoro, N.: Backward consistency and sense of direction in advanced distributed systems. SIAM J. Comput. 32(2), 281\u2013306 (2003)","journal-title":"SIAM J. Comput."},{"key":"154_CR27","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. In: Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN'04), pp. 141\u2013151 (2004)","DOI":"10.1007\/978-3-540-24698-5_18"},{"key":"154_CR28","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. In: Proceedings of the 29th Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 451\u2013462 (2004)","DOI":"10.1007\/978-3-540-28629-5_34"},{"key":"154_CR29","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"154_CR30","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/35.689634","volume":"36","author":"M.S. Greenberg","year":"1998","unstructured":"Greenberg, M.S., Byington, J.C., Harper, D.G.: Mobile agents and security. IEEE Commun. Mag. 36(7), 76\u201385 (1998)","journal-title":"IEEE Commun. Mag."},{"key":"154_CR31","unstructured":"Gyuri, E.: On division of graphs to connected subgraphs. In: Proceedings of the 5th Hungarian Combinatorial Colloquium (1976)"},{"key":"154_CR32","doi-asserted-by":"crossref","unstructured":"Hohl, F.: Time limited blackbox security: Protecting mobile agents from malicious hosts. In: Proceedings of the Conference on Mobile Agent Security, LNCS 1419, pp. 92\u2013113 (1998)","DOI":"10.1007\/3-540-68671-1_6"},{"key":"154_CR33","doi-asserted-by":"crossref","unstructured":"Hohl, F.: A framework to protect mobile agents by using reference states. In Proceedings of the 20th International Conference on Distributed Computing Systems (ICDCS 2000) (2000)","DOI":"10.1109\/ICDCS.2000.840953"},{"issue":"2","key":"154_CR34","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0004-3702(99)00107-1","volume":"117","author":"N.R. Jennings","year":"2000","unstructured":"Jennings, N.R.: On agent-based software engineering. Artif. Intell. 117(2), 277\u2013296 (2000)","journal-title":"Artif. Intell."},{"key":"154_CR35","unstructured":"Kozen, D.: Automata and planar graphs. In: Proceedings of the Fundations Computatial Theory (FCT'79), pp. 243\u2013254 (1979)"},{"key":"154_CR36","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the International Conference on Distibuted Computing Systems (ICDCS'03), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"issue":"3,4","key":"154_CR37","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e0sz","year":"1977","unstructured":"Lov\u00e0sz, L.: A homology theory for spanning trees of a graph. Acta Mathematica Academiae Scientiarum Hungaricae 30(3,4), 241\u2013251 (1977)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"issue":"1","key":"154_CR38","first-page":"3","volume":"15","author":"H. Muller","year":"1979","unstructured":"Muller, H.: Automata catching labyrinths with at most three components. Elektronische Informationsverarbeitung und Kybernetic 15(1), 3\u20139 (1979)","journal-title":"Elektronische Informationsverarbeitung und Kybernetic"},{"key":"154_CR39","unstructured":"Ng, S.K., Cheung, K.W.: Protecting mobile agents against malicious hosts by intention spreading. In: Proceedings of the 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), pp. 725\u2013729 (1999)"},{"issue":"12","key":"154_CR40","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/S0140-3664(99)00083-3","volume":"22","author":"R. Oppliger","year":"1999","unstructured":"Oppliger, R.: Security issues related to mobile code and agent-based systems. Comput. Commun. 22(12), 1165\u20131170 (1999)","journal-title":"Comput. Commun."},{"key":"154_CR41","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorith. 33, 281\u2013295 (1999)","journal-title":"J. Algorith."},{"key":"154_CR42","unstructured":"Rabin, M.O.: Maze threading automata. Technical Report Seminar Talk, University of California at Berkeley (1967)"},{"key":"154_CR43","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00288647","volume":"13","author":"H.A. Rollik","year":"1980","unstructured":"Rollik, H.A.: Automaten in planaren graphen. Acta Inform. 13, 287\u2013298 (1980)","journal-title":"Acta Inform."},{"key":"154_CR44","unstructured":"Roo, N., Hareti, S., Shi, W., Iyengar, S.: Robot navigation in unknown terrains: Introductory survey of length,non-heuristic algorithms. Technical Report ORNL\/TM12410, Oak Ridge National Lab. (1993)"},{"key":"154_CR45","doi-asserted-by":"crossref","unstructured":"Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Proceedings of the Conference on Mobile Agent Security, LNCS 1419, pp. 44\u201360 (1998)","DOI":"10.1007\/3-540-68671-1_4"},{"key":"154_CR46","doi-asserted-by":"crossref","unstructured":"Schelderup, K., Ones, J.: Mobile agent security\u2013issues and directions. In: Proceedings of the 6th International Conference on Intelligence and Services in Networks, LNCS 1597, pp. 155\u2013167 (1999)","DOI":"10.1007\/3-540-48888-X_16"},{"key":"154_CR47","unstructured":"Shannon, CL.E.: Presentation of a maze-solving machine. In: Proceedings of the 8th Conference of the Josiah Macy Jr. Found. (Cybernetics), pp. 173\u2013180 (1951)"},{"key":"154_CR48","unstructured":"Vitek, J., Castagna, G.: Mobile computations and hostile hosts. In: Tsichritzis, D. (ed.). Mobile Objects, pp. 241\u2013261. University of Geneva (1999)"},{"key":"154_CR49","doi-asserted-by":"crossref","unstructured":"Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: Proceedings of the International Colloquium on Automata Languages and Programming (ICALP'96), pp. 610\u2013621 (1996)","DOI":"10.1007\/3-540-61440-0_163"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0154-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0154-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0154-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:38:02Z","timestamp":1736282282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0154-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,21]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,8,23]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0154-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2006,2,21]]}}}