Efficient loopless generation of Gray codes for \(k\)-ary trees.
From MaRDI portal
Publication:1607068
DOI10.1016/S0020-0190(00)00139-3zbMath1050.68535MaRDI QIDQ1607068
Chang-jie Tang, Limin Xiang, Kazuo Ushijima
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (5)
A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Generation oft-ary trees with Ballot-sequences* ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ On generating \(k\)-ary trees in computer representation
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
- Loopless generation of \(k\)-ary tree sequences
- On generating \(k\)-ary trees in computer representation
- Loopless generation of Gray codes for \(k\)-ary trees
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees using rotations
- On Rotations and the Generation of Binary Trees
- Grammar-Oriented Enumeration of Binary Trees
- A Loopless Gray-Code Algorithm for Listing k-ary Trees
This page was built for publication: Efficient loopless generation of Gray codes for \(k\)-ary trees.
