A loopless algorithm for generating multiple binary tree sequences simultaneously

DOI10.1016/J.TCS.2014.07.030MaRDI QIDQ300220zbMATH OpenOpenAlexFDO

Authors Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai

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

zbMATH Keywords

binary treesconstant amortized timeGray-code orderloopless generating algorithms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A constant amortized time algorithm for generating left-child sequences in lexicographic order
• On the loopless generation of binary tree sequences
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• A note on generating binary trees inA-order andB-order

Cites work

• scientific article; zbMATH DE number 4055654 (Why is no real title available?)
• scientific article; zbMATH DE number 1792682 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• A loopless algorithm for generating binary tree sequences
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• Enumerating, Ranking and Unranking Binary Trees
• Generating a Gray code for P-sequences
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Loopless generation of Gray codes for \(k\)-ary trees
• Loopless generation of \(k\)-ary tree sequences
• O(1) Time Algorithms for Combinatorial Generation by Tree Traversal
• On Rotations and the Generation of Binary Trees
• On O(1) time algorithms for combinatorial generation
• On the loopless generation of binary tree sequences
• Shifts and loopless generation of \(k\)-ary trees

Cited in

(10)

• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
• Gray code generation of binary trees encoded in left-child sequences
• 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
• On the loopless generation of binary tree sequences
• Loopless Generation of Schroder Trees
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• Loopless generation of \(k\)-ary tree sequences
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order

This page was built for publication: A loopless algorithm for generating multiple binary tree sequences simultaneously

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300220)