Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order☆
Under an Elsevier user license
open archive
Keywords
Binary trees
Left-child sequences
Generation algorithms
Ranking/unranking algorithms
Lexicographic order
Amortized cost
Cited by (0)
- ☆
This paper combines and extends results appearing in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA 2016) and the 11th International Frontiers of Algorithmics Workshop (FAW 2017). The research was partially supported by MOST grants 107-2221-E-131-011, 107-2221-E-141-001-MY3 and 104-2221-E-262-005 from the Ministry of Science and Technology, Taiwan.
© 2018 Elsevier B.V.