A Loopless Gray-Code Algorithm for Listing k-ary Trees
From MaRDI portal
Publication:4953247
DOI10.1006/jagm.1999.1073zbMath0954.68054MaRDI QIDQ4953247
Dominique Roelants van Baronaigien
Publication date: 4 October 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1073
Related Items
A loopless algorithm for generating multiple binary tree sequences simultaneously, A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words, The rotation graph of \(k\)-ary trees is Hamiltonian, Gray codes for reflectable languages, Generating binary trees by Glivenko classes on Tamari lattices, On generating \(k\)-ary trees in computer representation, Efficient loopless generation of Gray codes for \(k\)-ary trees., Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously