{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:37:17Z","timestamp":1740116237425,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131219"},{"type":"electronic","value":"9783642131226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13122-6_20","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T09:26:31Z","timestamp":1274347591000},"page":"190-201","source":"Crossref","is-referenced-by-count":9,"title":["Mapping an Unfriendly Subway System"],"prefix":"10.1007","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 C.","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B. Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comp. Sci.\u00a014(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-75142-7_11","volume-title":"Distributed Computing","author":"J. Chalopin","year":"2007","unstructured":"Chalopin, J., Das, S., Santoro, N.: Rendezvous of mobile agents in unknown graphs with faulty links. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 108\u2013122. Springer, Heidelberg (2007)"},{"key":"20_CR3","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, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 320\u2013332. Springer, Heidelberg (2006)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cooper, C., Klasing, R., Radzik, T.: Locating and repairing faults in a network with mobile agents. Theoretical Computer Science (to appear 2010)","DOI":"10.1016\/j.tcs.2010.01.011"},{"issue":"2,3","key":"20_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.3233\/FUN-2006-712-305","volume":"71","author":"J. Czyzowicz","year":"2006","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae\u00a071(2,3), 229\u2013242 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"20_CR6","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. Combin. Probab. Comput.\u00a016(4), 595\u2013619 (2007)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-006-0154-y","volume":"19","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks. Distibuted Computing\u00a019(1), 1\u201319 (2006)","journal-title":"Distibuted Computing"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","volume":"48","author":"S. Dobrev","year":"2007","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica\u00a048(1), 67\u201390 (2007)","journal-title":"Algorithmica"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-87779-0_16","volume-title":"Distributed Computing","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: Optimal black hole search with pure tokens. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 227\u2013241. Springer, Heidelberg (2008)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Map construction and exploration by mobile agents scattered in a dangerous network. In: IPDPS 2009, pp. 1\u201310 (2009)","DOI":"10.1109\/IPDPS.2009.5161080"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/978-3-642-10631-6_55","volume-title":"ISAAC 2009","author":"P. Flocchini","year":"2009","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Exploration of periodically varying graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 534\u2013543. Springer, Heidelberg (2009)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-05434-1_13","volume-title":"ALGOSENSORS 2009","author":"P. Glaus","year":"2009","unstructured":"Glaus, P.: Locating a black hole without the knowledge of incoming links. In: Lerner, A. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 128\u2013138. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2007.04.024","volume":"384","author":"R. Klasing","year":"2007","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoretical Computer Science\u00a0384(2-3), 201\u2013221 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20233","volume":"54","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for black hole search problems. Networks\u00a054(4), 216\u2013226 (2008)","journal-title":"Networks"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-642-10877-8_9","volume-title":"OPODIS 2009","author":"A. Kosowski","year":"2009","unstructured":"Kosowski, A., Navarra, A., Pinotti, M.C.: Synchronization helps robots to detect black holes in directed graphs. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 86\u201398. Springer, Heidelberg (2009)"},{"issue":"9","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TPDS.2008.218","volume":"20","author":"C. Liu","year":"2009","unstructured":"Liu, C., Wu, J.: Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distrib. Syst.\u00a020(9), 1325\u20131338 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: 2005 Joint Work. on Foundations of Mobile Computing, pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, X., Kurose, J., Levine, B., Towsley, D., Zhang, H.: Study of a bus-based disruption-tolerant network. In: 13th Int. Conf. on Mobile Computing and Networking, p. 206 (2007)","DOI":"10.1145\/1287853.1287876"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/COMST.2006.323440","volume":"8","author":"Z. Zhang","year":"2006","unstructured":"Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communications Surveys & Tutorials\u00a08(1), 24\u201337 (2006)","journal-title":"IEEE Communications Surveys & Tutorials"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13122-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:42:09Z","timestamp":1740098529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13122-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131219","9783642131226"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13122-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}