{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:42Z","timestamp":1740145182889,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T00:00:00Z","timestamp":1593216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T00:00:00Z","timestamp":1593216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2221-M-262-001","107-2221-E-141-001-MY3"],"award-info":[{"award-number":["108-2221-M-262-001","107-2221-E-141-001-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11590-020-01613-z","type":"journal-article","created":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T07:09:00Z","timestamp":1593241740000},"page":"1133-1154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A loopless algorithm for generating (k,\u00a0m)-ary trees in Gray code order"],"prefix":"10.1007","volume":"15","author":[{"given":"Yu-Hsuan","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,27]]},"reference":[{"issue":"4","key":"1613_CR1","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s41980-018-0190-y","volume":"45","author":"M Amani","year":"2019","unstructured":"Amani, M., Nowzari-Dalini, A.: Efficient generation, ranking, and unranking of $$(k, m)$$-ary trees in B-order. Bull. Iranian Math. Soc. 45(4), 1145\u20131158 (2019)","journal-title":"Bull. Iranian Math. Soc."},{"key":"1613_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00469-z","author":"Y-H Chang","year":"2020","unstructured":"Chang, Y.-H., Wu, R.-Y., Chang, R.-S., Chang, J.-M.: Improved algorithms for ranking and unranking $$(k,m)$$-ary trees in B-order. J. Combin. Optim. (2020). https:\/\/doi.org\/10.1007\/s10878-019-00469-z","journal-title":"J. Combin. Optim."},{"key":"1613_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.dam.2015.03.001","volume":"188","author":"D\u017d Dokovi\u0107","year":"2015","unstructured":"Dokovi\u0107, D.\u017d., Kotsireas, I., Recoskie, D., Sawada, J.: Charm bracelets and their application to the construction of periodic Golay pairs. Discrete Appl. Math. 188, 32\u201340 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1613_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.03.006","volume":"72","author":"PB Dragon","year":"2018","unstructured":"Dragon, P.B., Hernandez, O.I., Sawada, J., Williams, A., Wong, D.: Constructing de Bruijn sequences with co-lexicographic order: the k-ary Grandmama sequence. Euro. J. Combin. 72, 1\u201311 (2018)","journal-title":"Euro. J. Combin."},{"issue":"4","key":"1613_CR5","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1016\/j.ejc.2006.01.011","volume":"28","author":"RRX Du","year":"2007","unstructured":"Du, R.R.X., Liu, F.: $$(k, m)$$-Catalan numbers and hook length polynomials for plane trees. Euro. J. Combin. 28(4), 1312\u20131321 (2007)","journal-title":"Euro. J. Combin."},{"issue":"3","key":"1613_CR6","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial objects. J. ACM 20(3), 500\u2013513 (1973)","journal-title":"J. ACM"},{"key":"1613_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2019.04.007","volume":"791","author":"P Hartman","year":"2019","unstructured":"Hartman, P., Sawada, J.: Ranking and unranking fixed-density necklaces and Lyndon words. Theoret. Comput. Sci. 791, 36\u201347 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"83","key":"1613_CR8","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"SM Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of permutations by adjacent transposition. Math. Comput. 17(83), 282\u2013285 (1963)","journal-title":"Math. Comput."},{"key":"1613_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2012.11.024","volume":"475","author":"S Karim","year":"2013","unstructured":"Karim, S., Sawada, J., Alamgir, Z., Husnine, S.: Generating bracelets with fixed content. Theoret. Comput. Sci. 475, 103\u2013112 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1613_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(99)00035-6","volume":"70","author":"JF Korsh","year":"1999","unstructured":"Korsh, J.F., LaFollette, P.: Loopless generation of Gray code for $$k$$-ary trees. Inform. Process. Lett. 70(1), 7\u201311 (1999)","journal-title":"Inform. Process. Lett."},{"key":"1613_CR11","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, Rockville (1999)"},{"key":"1613_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.dam.2018.09.035","volume":"268","author":"K-J Pai","year":"2019","unstructured":"Pai, K.-J., Chang, J.-M., Wu, R.-Y., Chang, S.-C.: Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discrete Appl. Math. 268, 223\u2013236 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1613_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1093\/comjnl\/29.2.171","volume":"29","author":"J Pallo","year":"1986","unstructured":"Pallo, J.: Enumerating, ranking and unranking binary trees. Comput. J. 29(2), 171\u2013175 (1986)","journal-title":"Comput. J."},{"issue":"1","key":"1613_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207168508803477","volume":"18","author":"J Pallo","year":"1985","unstructured":"Pallo, J., Racca, R.: A note on generating binary trees in A-order and B-order. Int. J. Comput. Math. 18(1), 27\u201339 (1985)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"1613_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jagm.1999.1073","volume":"35","author":"D van Roelants Baronaigien","year":"2000","unstructured":"van Roelants Baronaigien, D.: A loopless Gray-code algorithm for listing $$k$$-ary trees. J. Algorithms 35(1), 100\u2013107 (2000)","journal-title":"J. Algorithms"},{"issue":"4","key":"1613_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"CD Savage","year":"1997","unstructured":"Savage, C.D.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"issue":"1","key":"1613_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S0097539700377037","volume":"31","author":"J Sawada","year":"2001","unstructured":"Sawada, J.: Generating bracelets in constant amortized time. SIAM J. Comput. 31(1), 259\u2013268 (2001)","journal-title":"SIAM J. Comput."},{"key":"1613_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0304-3975(03)00049-5","volume":"301","author":"J Sawada","year":"2003","unstructured":"Sawada, J.: A fast algorithm to generate necklaces with fixed content. Theoret. Comput. Sci. 301, 477\u2013489 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1613_CR19","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/050641405","volume":"21","author":"J Sawada","year":"2007","unstructured":"Sawada, J.: A simple Gray code to list all minimal signed binary representations. SIAM J. Discrete Math. 21(1), 16\u201325 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1613_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2012.01.013","volume":"502","author":"J Sawada","year":"2013","unstructured":"Sawada, J., Williams, A.: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theoret. Comput. Sci. 502, 46\u201354 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"1613_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jda.2017.10.002","volume":"46\u201347","author":"J Sawada","year":"2017","unstructured":"Sawada, J., Williams, A., Wong, D.: Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. J. Discrete Algorithms 46\u201347, 25\u201335 (2017)","journal-title":"J. Discrete Algorithms"},{"key":"1613_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)"},{"issue":"3","key":"1613_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(98)00155-0","volume":"68","author":"V Vajnovszki","year":"1998","unstructured":"Vajnovszki, V.: On the loopless generation of binary tree sequences. Inform. Process. Lett. 68(3), 113\u2013117 (1998)","journal-title":"Inform. Process. Lett."},{"key":"1613_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1015622720041","volume":"1","author":"V Vajnovszki","year":"2002","unstructured":"Vajnovszki, V.: Generating a Gray code for P-sequences. J. Math. Model. Algo. 1, 31\u201341 (2002)","journal-title":"J. Math. Model. Algo."},{"key":"1613_CR25","volume-title":"Combinatorics for Computer Science","author":"SG Williamson","year":"1985","unstructured":"Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)"},{"key":"1613_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2014.07.030","volume":"556","author":"R-Y Wu","year":"2014","unstructured":"Wu, R.-Y., Chang, J.-M., Chan, H.-C., Pai, K.-J.: A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556, 25\u201333 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1613_CR27","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1587\/transfun.E99.A.1067","volume":"E99\u2013A","author":"R-Y Wu","year":"2016","unstructured":"Wu, R.-Y., Chang, J.-M., Peng, S.-L., Liu, C.-L.: Gray-code ranking and unranking on left-weight sequences of binary trees. IEICE Trans. Fund. E99\u2013A(6), 1067\u20131074 (2016)","journal-title":"IEICE Trans. Fund."},{"issue":"2","key":"1613_CR28","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1587\/transinf.E94.D.226","volume":"E94\u2013D","author":"R-Y Wu","year":"2011","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: Ranking and unranking of $$t$$-ary trees using RD-sequences. IEICE Trans. Inform. Syst. E94\u2013D(2), 226\u2013232 (2011)","journal-title":"IEICE Trans. Inform. Syst."},{"issue":"4","key":"1613_CR29","first-page":"679","volume":"15","author":"R-Y Wu","year":"2014","unstructured":"Wu, R.-Y., Hsu, C.-H., Chang, J.-M.: Loopless algorithms for listing Zaks\u2019 sequences in Gray-code order. J. Internet Tech. 15(4), 679\u2013684 (2014)","journal-title":"J. Internet Tech."},{"issue":"4\u20136","key":"1613_CR30","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0020-0190(00)00139-3","volume":"76","author":"L Xiang","year":"2000","unstructured":"Xiang, L., Ushijima, K., Tang, C.: Efficient loopless generation of Gray codes for $$k$$-ary trees. Inform. Process. Lett. 76(4\u20136), 169\u2013174 (2000)","journal-title":"Inform. Process. Lett."},{"issue":"5\u20136","key":"1613_CR31","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0020-0190(00)00155-1","volume":"77","author":"L Xiang","year":"2001","unstructured":"Xiang, L., Ushijima, K., Tang, C.: On generating $$k$$-ary trees in computer representation. Inform. Process. Lett. 77(5\u20136), 231\u2013238 (2001)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"1613_CR32","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theor. Comput. Sci. 10(1), 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01613-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01613-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01613-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,27]],"date-time":"2021-06-27T00:18:27Z","timestamp":1624753107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01613-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,27]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1613"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01613-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,6,27]]},"assertion":[{"value":"25 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}