Pages that link to "Item:Q1339380"
From MaRDI portal
The following pages link to Loopless generation of \(k\)-ary tree sequences (Q1339380):
Displayed 10 items.
- Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
- On the loopless generation of binary tree sequences (Q293424) (← links)
- A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
- Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
- A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
- Ranking and unranking<i>k</i>-ary trees with a 4<i>k –</i>4 letter alphabet (Q4366347) (← links)
- A-order generation of k-ary trees with a 4k–4 letter alphabet (Q4718611) (← links)
- Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)