On the loopless generation of binary tree sequences

DOI10.1016/S0020-0190(98)00155-0zbMath1338.68209MaRDI QIDQ293424

Vicentiu Vajnovszki

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001550?np=y

zbMATH Keywords

combinatorial problemsdesign of algorithmsbinary tree sequencesloopless generating algorithms

Mathematics Subject Classification ID

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

Related Items (18)

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ A loopless algorithm for generating the permutations of a multiset ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ A direct algorithm for restricted rotation distance ⋮ Constant time generation of derangements ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Efficient generation of restricted growth words ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Gray codes for reflectable languages ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Generation oft-ary trees with Ballot-sequences^* ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.

Cites Work

• Unnamed Item
• Unnamed Item
• A loopless algorithm for generating binary tree sequences
• Loopless generation of \(k\)-ary tree sequences
• A Gray Code for the Ideals of a Forest Poset
• Generating binary trees by transpositions
• Enumerating, Ranking and Unranking Binary Trees
• Generating binary trees using rotations
• The rotation graph of binary trees is Hamiltonian
• On Rotations and the Generation of Binary Trees

This page was built for publication: On the loopless generation of binary tree sequences