{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:58Z","timestamp":1725491338557},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_11","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"108-122","source":"Crossref","is-referenced-by-count":31,"title":["Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/800141.804655","volume-title":"STOC 1980","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: STOC 1980. Proc. 12th ACM Symp. on Theory of Computing, pp. 82\u201393. ACM Press, New York (1980)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00224-005-1223-5","volume":"40","author":"L. Barri\u00e8re","year":"2007","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory of Computing Systems\u00a040(2), 143\u2013162 (2007)","journal-title":"Theory of Computing Systems"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45414-4_3","volume-title":"Distributed Computing","author":"P. Boldi","year":"2001","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(00)00455-6","volume":"243","author":"P. Boldi","year":"2002","unstructured":"Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math.\u00a0243, 21\u201366 (2002)","journal-title":"Discrete Math."},{"key":"11_CR6","unstructured":"Chalopin, J., Das, S., Santoro, N.: Rendezvous of Mobile Agents in Anonymous Networks with Faulty Channels. Technical Report TR-2007-02, University of Ottawa (2007)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_14","volume-title":"Principles of Distributed Systems","author":"J. Chalopin","year":"2006","unstructured":"Chalopin, J., Godard, E., M\u00e9tivier, Y., Ossamy, R.: Mobile agents algorithms versus message passing algorithms. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, Springer, Heidelberg (2006)"},{"key":"11_CR8","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, A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 320\u2013332. Springer, Heidelberg (2006)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in synchronous tree networks. Combinatorics, Probability and Computing (to appear, 2007)","DOI":"10.1017\/S0963548306008133"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A. Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile agents searching for a black hole in an anonymous ring. Algorithmica (to appear, 2007)","DOI":"10.1007\/s00453-006-1232-z"},{"key":"11_CR12","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. Distributed Computing (to appear, 2007)","DOI":"10.1007\/s00446-006-0154-y"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-27860-3_6","volume-title":"Principles of Distributed Systems","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple agents rendezvous in a ring in spite of a black hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol.\u00a03144, pp. 34\u201346. Springer, Heidelberg (2004)"},{"key":"11_CR14","unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring a dangerous unknown graph using tokens. In: TCS 2006. Proc. of 5th IFIP International Conference on Theoretical Computer Science (2006)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11611257_26","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"L. Gasieniec","year":"2006","unstructured":"Gasieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 282\u2013292. Springer, Heidelberg (2006)"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00224-003-1062-1","volume":"37","author":"E. Godard","year":"2004","unstructured":"Godard, E., M\u00e9tivier, Y., Muscholl, A.: Characterization of classes of graphs recognizable by local computations. Theory of Computing Systems\u00a037(2), 249\u2013293 (2004)","journal-title":"Theory of Computing Systems"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/11940128_74","volume-title":"Algorithms and Computation","author":"R. Klasing","year":"2006","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 744\u2013753. Springer, Heidelberg (2006)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoretical Computer Science (to appear, 2007)","DOI":"10.1016\/j.tcs.2007.04.024"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/11682462_60","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: Mobile agent rendezvous in a synchronous torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 653\u2013664. Springer, Heidelberg (2006)"},{"issue":"5","key":"11_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0020-0190(97)00022-7","volume":"61","author":"A. Mazurkiewicz","year":"1997","unstructured":"Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters\u00a061(5), 233\u2013239 (1997)","journal-title":"Inf. Processing Letters"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/301308.301352","volume-title":"PODC 1999","author":"N. Sakamoto","year":"1999","unstructured":"Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: PODC 1999. Proc. 18th ACM Symposium on Principles of Distributed Computing, pp. 173\u2013179. ACM Press, New York (1999)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Parts I and II. IEEE Trans. Parallel and Distributed Systems\u00a07(1), 69\u201396 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X. Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 610\u2013621. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:33Z","timestamp":1619520753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}