A loopless algorithm for generating multiple binary tree sequences simultaneously
From MaRDI portal
Publication:300220
DOI10.1016/J.TCS.2014.07.030zbMath1338.68282OpenAlexW2292975032MaRDI QIDQ300220
Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Ro-Yu Wu
Publication date: 27 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.030
Related Items (4)
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shifts and loopless generation of \(k\)-ary trees
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating binary tree sequences
- Loopless generation of \(k\)-ary tree sequences
- Loopless generation of Gray codes for \(k\)-ary trees
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- Generating a Gray code for P-sequences
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- On O(1) Time Algorithms for Combinatorial Generation
- Enumerating, Ranking and Unranking Binary Trees
- On Rotations and the Generation of Binary Trees
- O(1) Time Algorithms for Combinatorial Generation by Tree Traversal
- A Loopless Gray-Code Algorithm for Listing k-ary Trees
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
This page was built for publication: A loopless algorithm for generating multiple binary tree sequences simultaneously
