{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:12Z","timestamp":1720201032280},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"vor","delay-in-days":1487,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.tcs.2012.01.035","type":"journal-article","created":{"date-parts":[[2012,2,6]],"date-time":"2012-02-06T13:02:17Z","timestamp":1328533337000},"page":"60-76","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["More efficient periodic traversal in anonymous undirected graphs"],"prefix":"10.1016","volume":"444","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Lignos","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.01.035_br000005","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/mana.19780860120","article-title":"Automata and labyrinths","author":"Budach","year":"1978","journal-title":"Mathematische Nachrichten"},{"issue":"4","key":"10.1016\/j.tcs.2012.01.035_br000010","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/1383369.1383373","article-title":"Label-guided graph exploration by a finite automaton","volume":"4","author":"Cohen","year":"2008","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"10.1016\/j.tcs.2012.01.035_br000015","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1137\/0209048","article-title":"Space lower bounds for maze threadability on restricted machines","volume":"9","author":"Cook","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.01.035_br000020","series-title":"Proceedings of the 12th Colloquium on Structural Information and Communication Complexity, SIROCCO~2005","first-page":"127","article-title":"Finding short right-hand-on-the-wall walks in graphs","volume":"vol. 3499","author":"Dobrev","year":"2005"},{"key":"10.1016\/j.tcs.2012.01.035_br000025","series-title":"Theoretical Computer Science : Essays in Memory of Shimon Even","first-page":"1","article-title":"The reduced automata technique for graph exploration space lower bounds","volume":"vol. 3895","author":"Fraigniaud","year":"2006"},{"issue":"4","key":"10.1016\/j.tcs.2012.01.035_br000030","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.tcs.2012.01.035_br000035","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1016\/j.jcss.2007.09.004","article-title":"Fast periodic graph exploration with constant memory","volume":"74","author":"G\u0105sieniec","year":"2008","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.tcs.2012.01.035_br000040","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","article-title":"Setting port numbers for fast graph exploration","volume":"401","author":"Ilcinkas","year":"2008","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.01.035_br000045","series-title":"Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS~2009","first-page":"501","article-title":"Graph decomposition for improving memoryless periodic exploration","volume":"vol. 5734","author":"Kosowski","year":"2009"},{"issue":"5","key":"10.1016\/j.tcs.2012.01.035_br000050","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","article-title":"A method for synthesizing sequential circuits","volume":"34","author":"Mealy","year":"1955","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/j.tcs.2012.01.035_br000055","doi-asserted-by":"crossref","unstructured":"O. Reingold, Undirected ST-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC\u00a02005, 2005, pp. 376\u2013385.","DOI":"10.1145\/1060590.1060647"},{"key":"10.1016\/j.tcs.2012.01.035_br000060","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00288647","article-title":"Automaten in planaren graphen","volume":"13","author":"Rollik","year":"1980","journal-title":"Acta Informatica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512000825?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512000825?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T09:58:17Z","timestamp":1543226297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512000825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":12,"alternative-id":["S0304397512000825"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2012.01.035","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}