Pages that link to "Item:Q3696535"
From MaRDI portal
The following pages link to Enumerating Ordered Trees Lexicographically (Q3696535):
Displaying 11 items.
- Generating ordered trees (Q1102758) (← links)
- Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
- On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- Ordered trees and the inorder traversal (Q2502899) (← links)
- Lexicographic Enumeration of k-ary Trees (Q3690238) (← links)
- Ranking and Unranking of Non-regular Trees (Q3792254) (← links)
- Random generation of colored trees (Q5096321) (← links)
- Clean Reversible Simulations of Ranking Binary Trees (Q5112174) (← links)
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order (Q5903738) (← links)
- The rotation \(\chi\)-lattice of ternary trees (Q5943902) (← links)