{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:41Z","timestamp":1725543821193},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_6","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T10:45:59Z","timestamp":1151059559000},"page":"59-69","source":"Crossref","is-referenced-by-count":4,"title":["Setting Port Numbers for Fast Graph Exploration"],"prefix":"10.1007","author":[{"given":"David","family":"Ilcinkas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1137\/S009753979223277X","volume":"23","author":"Y. Afek","year":"1994","unstructured":"Afek, Y., Gafni, E.: Distributed Algorithms for Unidirectional Networks. SIAM J. Computing\u00a023(6), 1152\u20131178 (1994)","journal-title":"SIAM J. Computing"},{"key":"6_CR2","doi-asserted-by":"publisher","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. Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M. Bender","year":"2002","unstructured":"Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation\u00a0176(1), 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Budach, L.: Automata and labyrinths. Math. Nachrichten, 195\u2013282 (1978)","DOI":"10.1002\/mana.19780860120"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11523468_28","volume-title":"Automata, Languages and Programming","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-Guided Graph Exploration by a Finite Automaton. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 335\u2013346. Springer, Heidelberg (2005)"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"S. Cook","year":"1980","unstructured":"Cook, S., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. on Computing\u00a09(3), 636\u2013652 (1980)","journal-title":"SIAM J. on Computing"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11429647_10","volume-title":"Structural Information and Communication Complexity","author":"S. Das","year":"2005","unstructured":"Das, S., Flocchini, P., Nayak, A., Santoro, N.: Distributed Exploration of an Unknown Graph. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 99\u2013114. Springer, Heidelberg (2005)"},{"issue":"3","key":"6_CR8","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":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"J. Graph Theory"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","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. Algorithms\u00a051(1), 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11429647_12","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2005","unstructured":"Dobrev, S., Jansson, J., Sadakane, K., Sung, W.-K.: Finding Short Right-Hand-on-the-Wall Walks in Graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 127\u2013139. Springer, Heidelberg (2005)"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","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. IEEE Transaction on Robotics and Automation\u00a07(6), 859\u2013865 (1991)","journal-title":"IEEE Transaction on Robotics and Automation"},{"key":"6_CR12","unstructured":"Duncan, C., Kobourov, S., Kumar, V.: Optimal constrained graph exploration. In: 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 807\u2013814 (2001)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11561071_4","volume-title":"Algorithms \u2013 ESA 2005","author":"R. Fleischer","year":"2005","unstructured":"Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 11\u201322. Springer, Heidelberg (2005)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0291(1), 29\u201353 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24698-5_18","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Collective Tree Exploration. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 141\u2013151. Springer, Heidelberg (2004)"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s004460100058","volume":"14","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C., Mans, B.: Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing\u00a014(4), 217\u2013229 (2001)","journal-title":"Distributed Computing"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-24749-4_22","volume-title":"STACS 2004","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraphs Exploration with Little Memory. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 246\u2013257. Springer, Heidelberg (2004)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-28629-5_34","volume-title":"Mathematical Foundations of Computer Science 2004","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph Exploration by a Finite Automaton. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 451\u2013462. Springer, Heidelberg (2004)"},{"key":"6_CR19","series-title":"Teubner-Texte zur Mathematik","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-94560-0","volume-title":"Labyrinth Problems: Labyrinth-Searching Abilities of Automata","author":"A. Hemmerling","year":"1989","unstructured":"Hemmerling, A.: Labyrinth Problems: Labyrinth-Searching Abilities of Automata. Teubner-Texte zur Mathematik, vol.\u00a0114. B. G. Teubner Verlagsgesellschaft, Leipzig (1989)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","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. Algorithms\u00a033(2), 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Rao, N., Kareti, S., Shi, W., Iyengar, S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Tech. Report ORNL\/TM-12410, Oak Ridge National Lab (1993)","DOI":"10.2172\/10180101"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected ST-Connectivity in Log-Space. In: 37th ACM Symp. on Theory of Computing (STOC), pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Rollik, H.: Automaten in planaren Graphen. Acta Informatica 13, 287\u2013298 (1980) (also in LNCS 67, pp. 266\u2013275 (1979))","DOI":"10.1007\/BF00288647"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:17Z","timestamp":1619493437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11780823_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}