Efficient Generation, Ranking, and Unranking of (k, m)-Ary Trees in B-Order
Crossref DOI link: https://doi.org/10.1007/s41980-018-0190-y
Published Online: 2018-12-06
Published Print: 2019-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Amani, M.
Nowzari-Dalini, A.
Text and Data Mining valid from 2018-12-06
Article History
Received: 5 June 2018
Revised: 25 October 2018
Accepted: 22 November 2018
First Online: 6 December 2018