On generating \(k\)-ary trees in computer representation

DOI10.1016/S0020-0190(00)00155-1zbMath0996.68241OpenAlexW2128656819MaRDI QIDQ1603407

Chang-jie Tang, Kazuo Ushijima, Limin Xiang

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00155-1

zbMATH Keywords

algorithmsloopless generationcomputer representation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (6)

Cool-lex order and \(k\)-ary Catalan structures ⋮ Unnamed Item ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.

Cites Work

• Unnamed Item
• Unnamed Item
• Shifts and loopless generation of \(k\)-ary trees
• On the loopless generation of binary tree sequences
• Lexicographic generation of ordered trees
• A loopless algorithm for generating binary tree sequences
• Enumeration of binary trees
• Loopless generation of \(k\)-ary tree sequences
• Loopless generation of Gray codes for \(k\)-ary trees
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• 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
• Grammar-Oriented Enumeration of Binary Trees
• Generating Regular k-ary Trees Efficiently
• A Loopless Gray-Code Algorithm for Listing k-ary Trees

This page was built for publication: On generating \(k\)-ary trees in computer representation