Loopless generation of Gray codes for \(k\)-ary trees

DOI10.1016/S0020-0190(99)00035-6zbMath1002.68102OpenAlexW1967896791MaRDI QIDQ1606919

James F. Korsh, Paul S. jun. LaFollette

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00035-6

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05)

Related Items

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Unnamed Item ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Generation oft-ary trees with Ballot-sequences^* ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ 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.