Crossmark

A loopless algorithm for generating (k, m)-ary trees in Gray code order

Published Online: 2020-06-27

Published Print: 2021-06

Authors

Chang, Yu-Hsuan

Wu, Ro-Yu

Lin, Cheng-Kuan

Chang, Jou-Ming http://orcid.org/0000-0002-9542-7968
Funding

Funding for this research was provided by:

Ministry of Science and Technology, Taiwan (108-2221-M-262-001, 107-2221-E-141-001-MY3)
License Information

Text and Data Mining valid from 2020-06-27

Version of Record valid from 2020-06-27
More Information

Article History

Received: 25 March 2020

Accepted: 19 June 2020

First Online: 27 June 2020

Document is current