Loop Free Generation ofK-Ary Trees

DOI10.1080/01966324.2000.10737507zbMath1087.68610OpenAlexW2034468591WikidataQ58256227 ScholiaQ58256227MaRDI QIDQ4811716

Dominique Roelants van Baronaigien

Publication date: 6 September 2004

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.2000.10737507

zbMATH Keywords

listing algorithmcombinatorial generation algorithm

Mathematics Subject Classification ID

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

Cites Work

• Generating t-ary trees in A-order
• An analysis of two related loop-free algorithms for generating integer partitions
• A loopless algorithm for generating binary tree sequences
• Loopless generation of \(k\)-ary tree sequences
• Enumerating, Ranking and Unranking Binary Trees
• Generating binary trees using rotations
• The rotation graph of binary trees is Hamiltonian
• Efficient generation of the binary reflected gray code and its applications
• Generating Binary Trees Lexicographically
• Generating t-Ary Trees Lexicographically
• On Rotations and the Generation of Binary Trees
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Loop Free Generation ofK-Ary Trees