{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:45:17Z","timestamp":1778496317554,"version":"3.51.4"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0196-6774(87)90019-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"395-404","source":"Crossref","is-referenced-by-count":21,"title":["Universal traversal sequences for paths and cycles"],"prefix":"10.1016","volume":"8","author":[{"given":"Michael F","family":"Bridgland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(87)90019-8_BIB1","series-title":"Proc. 20th IEEE Symp. on Foundations of Computer Science","first-page":"223","article-title":"Random walks, universal traversal sequences, and the complexity of maze problems","author":"Aleliunas","year":"1979"},{"key":"10.1016\/0196-6774(87)90019-8_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1986"},{"key":"10.1016\/0196-6774(87)90019-8_BIB3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(87)90019-8_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900198?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900198?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:24:43Z","timestamp":1548743083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677487900198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0196677487900198"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(87)90019-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}