Generation oft-ary trees with Ballot-sequences*
From MaRDI portal
Publication:4462115
Recommendations
- Parallel generation of í-ary trees with ballot-sequences
- Generating t-ary trees in A-order
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- Ranking and unranking algorithms for loopless generation of t-ary trees
- Sur la génération des arbres binaires par les B-suites
Cites work
- A note on generating binary trees inA-order andB-order
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- Generating t-Ary Trees Lexicographically
- Generating trees withnnodes andmleaves
- Generation of Binary Trees from Ballot Sequences
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Lexicographic generation of ordered trees
- Loopless generation of Gray codes for \(k\)-ary trees
- On a correspondence between binary trees and a certain type of permutation
- On the generation of binary trees from (0–1) codes
- On the generation ofP-sequences
- On the loopless generation of binary tree sequences
Cited in
(9)- Generating t-ary trees in A-order
- Generating trees and forbidden subsequences
- Cool-lex order and k-ary Catalan structures
- Generating 2-Gray codes for ballot sequences in constant amortized time
- Parallel generation of í-ary trees with ballot-sequences
- On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Greedy Gray codes for Dyck words and ballot sequences
- Staircase tilings and \(k\)-Catalan structures
This page was built for publication: Generation oft-ary trees with Ballot-sequences*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462115)
