{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:17:01Z","timestamp":1743041821304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030599003"},{"type":"electronic","value":"9783030599010"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59901-0_11","type":"book-chapter","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T08:02:41Z","timestamp":1600761761000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Loopless Algorithm for Generating (k,\u00a0m)-ary Trees in Gray-Code Order"],"prefix":"10.1007","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"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,23]]},"reference":[{"key":"11_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, 1145\u20131158 (2019)","journal-title":"Bull. Iranian Math. Soc."},{"key":"11_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":"11_CR3","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, 1312\u20131321 (2007)","journal-title":"Euro. J. Combin."},{"key":"11_CR4","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, 500\u2013513 (1973)","journal-title":"J. ACM"},{"key":"11_CR5","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. Inf. Process. Lett. 70, 7\u201311 (1999)","journal-title":"Inf. Process. Lett."},{"key":"11_CR6","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."},{"key":"11_CR7","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, 171\u2013175 (1986)","journal-title":"Comput. J."},{"key":"11_CR8","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, 27\u201339 (1985)","journal-title":"Int. J. Comput. Math."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jagm.1999.1073","volume":"35","author":"DR van Baronaigien","year":"2000","unstructured":"van Baronaigien, D.R.: A loopless Gray-code algorithm for listing $$k$$-ary trees. J. Algorithms 35, 100\u2013107 (2000)","journal-title":"J. Algorithms"},{"key":"11_CR10","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, 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"11_CR11","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)"},{"key":"11_CR12","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. Inf. Process. Lett. 68, 113\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"key":"11_CR13","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":"11_CR14","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":"11_CR15","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."},{"key":"11_CR16","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, 1067\u20131074 (2016)","journal-title":"IEICE Trans. Fund."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1093\/comjnl\/bxp015","volume":"53","author":"R-Y Wu","year":"2010","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: Loopless generation of non-regular trees with a prescribed branching sequence. Comput. J. 53, 661\u2013666 (2010)","journal-title":"Comput. J."},{"key":"11_CR18","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. Inf. Syst. E94\u2013D, 226\u2013232 (2011)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"11_CR19","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, 679\u2013684 (2014)","journal-title":"J. Internet Tech."},{"key":"11_CR20","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. Inf. Process. Lett. 76, 169\u2013174 (2000)","journal-title":"Inf. Process. Lett."},{"key":"11_CR21","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. Inf. Process. Lett. 77, 231\u2013238 (2001)","journal-title":"Inf. Process. Lett."},{"key":"11_CR22","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, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59901-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T21:30:40Z","timestamp":1619299840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59901-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030599003","9783030599010"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59901-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/faw2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}