{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:42Z","timestamp":1759063782088,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["A-3379"],"award-info":[{"award-number":["A-3379"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90040-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"225-238","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["Binary tree gray codes"],"prefix":"10.1016","volume":"6","author":[{"given":"Andrzej","family":"Proskurowski","sequence":"first","affiliation":[]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90040-9_BIB1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/360336.360343","article-title":"Efficient generation of the binary reflected gray code and its applications","volume":"19","author":"Bitner","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90040-9_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/00150517.1983.12429975","article-title":"The parity of the Catalan numbers via lattice paths","volume":"66","author":"Egecioglu","year":"1983","journal-title":"Fibonacci Quart"},{"key":"10.1016\/0196-6774(85)90040-9_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(80)90169-7","article-title":"Gray codes in graphs of subsets","volume":"31","author":"Joichi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90040-9_BIB4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1137\/0209013","article-title":"Combinatorial gray codes","volume":"9","author":"Joichi","year":"1980","journal-title":"SIAM J. Comput."},{"volume":"Vol. 1","year":"1973","author":"Knuth","key":"10.1016\/0196-6774(85)90040-9_BIB5"},{"year":"1978","series-title":"Combinatorial Algorithms","author":"Nijenhuis","key":"10.1016\/0196-6774(85)90040-9_BIB6"},{"year":"1977","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","key":"10.1016\/0196-6774(85)90040-9_BIB7"},{"key":"10.1016\/0196-6774(85)90040-9_BIB8","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","article-title":"Generating binary trees lexicographically","volume":"6","author":"Ruskey","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90040-9_BIB9","unstructured":"F. Ruskey and D. M. Miller, \u201cOn the Impossibility of Adjacent Interchange Generation of Combinations and Trees,\u201d technical report, Univ. of Victoria."},{"key":"10.1016\/0196-6774(85)90040-9_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","article-title":"Lexicographic generation of ordered trees","volume":"10","author":"Zaks","year":"1980","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:12:45Z","timestamp":1757463165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0196677485900409"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90040-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1985,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Binary tree gray codes","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(85)90040-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}