A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously

DOI10.1007/978-3-319-03780-6_30zbMath1338.68281OpenAlexW2477579405MaRDI QIDQ2867132

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

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_30

zbMATH Keywords

binary treesloopless generating algorithmsconstant amortized timeGray-code order

Mathematics Subject Classification ID

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

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