{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:05Z","timestamp":1725536825716},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_43","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"501-512","source":"Crossref","is-referenced-by-count":4,"title":["Graph Decomposition for Improving Memoryless Periodic Exploration"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":"J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Dobrev, S., G\u0105sieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, Y., Martin, R., Sadakane, K., Sung, W.: More efficient periodic traversal in anonymous undirected graphs. In: Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. Springer, Heidelberg (to appear, 2009)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-92248-3_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. G\u0105sieniec","year":"2008","unstructured":"G\u0105sieniec, L., Radzik, T.: Memory efficient anonymous graph exploration. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 14\u201329. Springer, Heidelberg (2008)"},{"key":"43_CR3","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)"},{"key":"43_CR4","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. Mathematische Nachrichten\u00a086, 195\u2013282 (1978)","journal-title":"Mathematische Nachrichten"},{"key":"43_CR5","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"},{"issue":"3","key":"43_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 Journal on Computing\u00a09(3), 636\u2013652 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"2-3","key":"43_CR7","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., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: Proc.\u00a037th Annual ACM Symposium on Theory of Computing (STOC), pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"issue":"12","key":"43_CR9","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.dam.2007.11.001","volume":"156","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Impact of memory size on graph exploration capability. Discrete Applied Mathematics\u00a0156(12), 2310\u20132319 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"43_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383373","volume":"4","author":"R. Cohen","year":"2008","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms\u00a04(4), 1\u201318 (2008)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1-3","key":"43_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","volume":"401","author":"D. Ilcinkas","year":"2008","unstructured":"Ilcinkas, D.: Setting port numbers for fast graph exploration. Theoretical Computer Science\u00a0401(1-3), 236\u2013242 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"43_CR12","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.jcss.2007.09.004","volume":"74","author":"L. G\u0105sieniec","year":"2008","unstructured":"G\u0105sieniec, L., Klasing, R., Martin, R., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. Journal of Computer and System Sciences\u00a074(5), 802\u2013822 (2008)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:34:00Z","timestamp":1558492440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}