On the loopless generation of binary tree sequences

DOI10.1016/S0020-0190(98)00155-0MaRDI QIDQ293424zbMATH OpenFDO

Authors Vincent 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

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

Recommendations

• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• Loopless generation of Gray codes for \(k\)-ary trees
• Generating a Gray code for P-sequences
• Binary tree gray codes

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

Cited in

(25)

• Generation oft-ary trees with Ballot-sequences^*
• Loop-free Gray code algorithms for the set of compositions
• A loopless algorithm for generating the permutations of a multiset
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• Constant-memory iterative generation of special strings representing binary trees
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• Constant Time Generation of Free Trees
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
• Generating trees and forbidden subsequences
• scientific article; zbMATH DE number 7267318 (Why is no real title available?)
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• Loopless Generation of Schroder Trees
• Generating binary trees by Glivenko classes on Tamari lattices
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A direct algorithm for restricted rotation distance
• Loopless generation of \(k\)-ary tree sequences
• An efficient algorithm for estimating rotation distance between two binary trees
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• On generating \(k\)-ary trees in computer representation
• Constant time generation of derangements
• Generating a Gray code for P-sequences
• Efficient generation of restricted growth words
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Gray codes for reflectable languages
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order

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

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