Loopless generation of \(k\)-ary tree sequences

DOI10.1016/0020-0190(94)00149-9zbMath0938.68755OpenAlexW2019444679MaRDI QIDQ1339380

James F. Korsh

Publication date: 21 June 2000

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00149-9

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (10)

Shifts and loopless generation of \(k\)-ary trees ⋮ On the loopless generation of binary tree sequences ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Loop Free Generation ofK-Ary Trees ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ A-order generation of k-ary trees with a 4k–4 letter alphabet ⋮ 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

• Generating t-ary trees in A-order
• A loopless algorithm for generating binary tree sequences
• Enumerating Ordered Trees Lexicographically
• Enumerating, Ranking and Unranking Binary Trees
• Generating binary trees using rotations
• A note on generating binary trees inA-order andB-order
• Efficient Generation of k-ary Trees in Natural Order
• A numbering system for binary trees
• Generation of Binary Trees from Ballot Sequences
• Generating t-Ary Trees Lexicographically
• On Rotations and the Generation of Binary Trees

This page was built for publication: Loopless generation of \(k\)-ary tree sequences