A-order generation of k-ary trees with a 4k–4 letter alphabet

DOI10.1080/02522667.1995.10699251zbMath0864.68072OpenAlexW1965626746MaRDI QIDQ4718611

James F. Korsh

Publication date: 9 June 1997

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-ary trees

Mathematics Subject Classification ID

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

Related Items (1)

Ranking and unrankingk-ary trees with a 4k –4 letter alphabet

Cites Work

• Generating t-ary trees in A-order
• A loopless algorithm for generating binary tree sequences
• Loopless generation of \(k\)-ary tree sequences
• The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm

This page was built for publication: A-order generation of k-ary trees with a 4k–4 letter alphabet