{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:07:51Z","timestamp":1743005271223,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_30","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"340-350","source":"Crossref","is-referenced-by-count":0,"title":["A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously"],"prefix":"10.1007","author":[{"given":"Ro-Yu","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Chang","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","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 configurations. J. ACM\u00a020, 500\u2013513 (1973)","journal-title":"J. ACM"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0020-0190(94)00149-9","volume":"52","author":"J.F. Korsh","year":"1994","unstructured":"Korsh, J.F.: Loopless generation of k-ary tree sequences. Inform. Process. Lett.\u00a052, 243\u2013247 (1994)","journal-title":"Inform. Process. Lett."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(99)00035-6","volume":"70","author":"J.F. Korsh","year":"1999","unstructured":"Korsh, J.F., LaFollette, P.: Loopless generation of Gray codes for k-ary trees. Inform. Process. Lett.\u00a070, 7\u201311 (1999)","journal-title":"Inform. Process. Lett."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0020-0190(97)00215-9","volume":"65","author":"J.F. Korsh","year":"1998","unstructured":"Korsh, J.F., Lipschutz, S.: Shift and loopless generation of k-ary trees. Inform. Process. Lett.\u00a065, 235\u2013240 (1998)","journal-title":"Inform. Process. Lett."},{"key":"30_CR5","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 4A \u2014 Generating All Trees, vol.\u00a04. Addison-Wesley (2005)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"J.M. Lucas","year":"1993","unstructured":"Lucas, J.M., Roelants van Baronaigien, D., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms\u00a015, 343\u2013366 (1993)","journal-title":"J. Algorithms"},{"key":"30_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.\u00a029, 171\u2013175 (1986)","journal-title":"Comput. J."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0020-0190(91)90178-K","volume":"39","author":"D. Roelants van Baronaigien","year":"1991","unstructured":"Roelants van Baronaigien, D.: A loopless algorithm for generating binary tree sequences. Inform. Process. Lett.\u00a039, 189\u2013194 (1991)","journal-title":"Inform. Process. Lett."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jagm.1999.1073","volume":"35","author":"D. Roelants van Baronaigien","year":"2000","unstructured":"Roelants van Baronaigien, D.: A loopless Gray-code algorithm for listing k-ary trees. J. Algorithms\u00a035, 100\u2013107 (2000)","journal-title":"J. Algorithms"},{"key":"30_CR10","first-page":"313","volume":"59","author":"D. Roelants van Baronaigien","year":"1987","unstructured":"Roelants van Baronaigien, D., Ruskey, F.: A Hamiltonian path in the rotation lattice of binary trees. Congr. Numer.\u00a059, 313\u2013318 (1987)","journal-title":"Congr. Numer."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1093\/comjnl\/42.5.400","volume":"42","author":"T. Takaoka","year":"1999","unstructured":"Takaoka, T.: O(1) time algorithms for combinatorial generation by tree traversal. Comput. J.\u00a042, 400\u2013408 (1999)","journal-title":"Comput. J."},{"key":"30_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. Inform. Process. Lett.\u00a068, 113\u2013117 (1998)","journal-title":"Inform. Process. Lett."},{"key":"30_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. Algorithms\u00a01, 31\u201341 (2002)","journal-title":"J. Math. Model. Algorithms"},{"key":"30_CR14","volume-title":"Combinatorics for Computer Science","author":"S.G. Williamson","year":"1985","unstructured":"Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2006.01.022","volume":"355","author":"R.-Y. Wu","year":"2006","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theor. Comput. Sci.\u00a0355, 303\u2013314 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR16","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.\u00a053, 661\u2013666 (2010)","journal-title":"Comput. J."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/44.4.292","volume":"44","author":"L. Xiang","year":"2001","unstructured":"Xiang, L., Ushijima, K.: On O(1) time algorithms for combinatorial generation. Comput. J.\u00a044, 292\u2013302 (2001)","journal-title":"Comput. J."},{"key":"30_CR18","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.\u00a076, 169\u2013174 (2000)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:53:14Z","timestamp":1558687994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}