{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:55:02Z","timestamp":1672343702245},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90125-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"25-28","source":"Crossref","is-referenced-by-count":15,"title":["Universal sequences for complete graphs"],"prefix":"10.1016","volume":"27","author":[{"given":"N.","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Azar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Ravid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90125-V_BIB1","series-title":"M.Sc. Thesis","article-title":"A simple graph traversing problem","author":"Aleliunas","year":"1978"},{"key":"10.1016\/0166-218X(90)90125-V_BIB2","first-page":"218","article-title":"Random walks, universal traversal sequences and the complexity of maze problems","author":"Aleliunas","year":"1979","journal-title":"Proceedings 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico"},{"key":"10.1016\/0166-218X(90)90125-V_BIB3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial and M. Werman, Bounds on universal sequences, SIAM J. Cornput. (to appear).","DOI":"10.1137\/0218018"},{"key":"10.1016\/0166-218X(90)90125-V_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1970"},{"key":"10.1016\/0166-218X(90)90125-V_BIB5","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1137\/0209048","article-title":"Space lower bounds by maze threadability on restricted machines","volume":"9","author":"Cook","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090125V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090125V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:01Z","timestamp":1555135021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090125V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090125V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90125-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}