{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T02:40:34Z","timestamp":1737168034116,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72951-8_4","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"26-40","source":"Crossref","is-referenced-by-count":1,"title":["Fast Periodic Graph Exploration with Constant Memory"],"prefix":"10.1007","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","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 Journal on Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., et al.: Piecemeal Graph Exploration by a Mobile Robot. Information and Computation\u00a0152(2), 155\u2013172 (1999)","journal-title":"Information and Computation"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kobourov, S.G.: Polylogarithmic-Overhead Piecemeal Graph Exploration. In: Proc. 11th Annual Conference on Computational Learning Theory (COLT 1998), pp. 280\u2013286 (1998)","DOI":"10.1145\/279943.279998"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., et al.: The Power of a Pebble: Exploring and Mapping Directed Graphs. Information and Computation\u00a0176(1), 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proc. 35th Ann. Symp. on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"4_CR6","first-page":"231","volume":"18","author":"M. Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning\u00a018, 231\u2013254 (1995)","journal-title":"Machine Learning"},{"key":"4_CR7","unstructured":"Bhatia, R., et al.: The Full Degree Spanning Tree Problem. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 864\u2013865 (1999)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/mana.19780860120","volume":"86","author":"L. Budach","year":"1978","unstructured":"Budach, L.: Automata and labyrinths. Math. Nachrichten\u00a086, 195\u2013282 (1978)","journal-title":"Math. Nachrichten"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/11523468_28","volume-title":"Automata, Languages and Programming","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., et al.: Label-guided graph exploration by a finite automaton. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 335\u2013346. Springer, Heidelberg (2005)"},{"issue":"3","key":"4_CR10","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":"4_CR11","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. Journal of Graph Theory\u00a032, 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"key":"4_CR12","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., et al.: Tree exploration with little memory. Journal of Algorithms\u00a051, 38\u201363 (2004)","journal-title":"Journal of Algorithms"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/11429647_12","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2005","unstructured":"Dobrev, S., et al.: 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)"},{"key":"4_CR14","first-page":"807","volume-title":"12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001)","author":"C.A. Duncan","year":"2001","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 807\u2013814. ACM Press, New York (2001)"},{"key":"4_CR15","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)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., et al.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345, 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11685654_1","volume-title":"Theoretical Computer Science","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., et al.: The Reduced Automata Technique for Graph Exploration Space Lower Bounds, Essays in Memory of Shimon Even. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol.\u00a03895, pp. 1\u201326. Springer, Heidelberg (2006)"},{"key":"4_CR19","unstructured":"G\u0105sieniec, L., et al.: Tree exploration with logarithmic memory. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) (2007)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11780823_6","volume-title":"Structural Information and Communication Complexity","author":"D. Ilcinkas","year":"2006","unstructured":"Ilcinkas, D.: Setting port numbers for fast graph exploration. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 59\u201369. Springer, Heidelberg (2006)"},{"key":"4_CR21","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. Journal of Algorithms\u00a033, 281\u2013295 (1999)","journal-title":"Journal of Algorithms"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected ST-Connectivity in Log-Space. In: Proc. 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00288647","volume":"13","author":"H. Rollik","year":"1980","unstructured":"Rollik, H.: Automaten in planaren Graphen. Acta Informatica\u00a013, 287\u2013298 (1980)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T02:06:07Z","timestamp":1737165967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729181","9783540729518"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}