{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T11:47:07Z","timestamp":1761392827268},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0020-0190(96)00179-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"313-318","source":"Crossref","is-referenced-by-count":2,"title":["Construction of natural cycletrees"],"prefix":"10.1016","volume":"60","author":[{"given":"Margus","family":"Veanes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"Barklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00179-2_BIB1","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(96)00179-2_BIB2","series-title":"COMPRA 92 \u2014 VAPP V","article-title":"A novel sorting array processor","volume":"634","author":"Lam","year":"1992"},{"issue":"1","key":"10.1016\/S0020-0190(96)00179-2_BIB3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jpdc.1996.0023","article-title":"Natural cycletrees: Flexible interconnection graphs","volume":"33","author":"Veanes","year":"1996","journal-title":"J. Parallel Distributed Computing"},{"key":"10.1016\/S0020-0190(96)00179-2_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(95)00183-2","article-title":"On the number of edges in cycletrees","volume":"57","author":"Veanes","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(96)00179-2_BIB5","series-title":"Distributed Memory Computing","article-title":"An optimal structure that accommodates both a ring and a binary tree","volume":"487","author":"Xie","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001792?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001792?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:00Z","timestamp":1555959180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0020019096001792"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00179-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}