Generating Trees and Other Combinatorial Objects Lexicographically
From MaRDI portal
Publication:4192083
Cited in
(27)- Listing and counting subtrees of equal size of a binary tree
- Generating binary trees of bounded height
- The generation of random, binary unordered trees
- Lexicographic generation of ordered trees
- On a theorem of Chorneyko and Mohanty
- Generating permutations with given ups and downs
- Solution of some multi-dimensional lattice path parity difference recurrence relations
- Finding parity difference by involutions
- Efficient tree decomposition of high-rank tensors
- A shift Gray code for fixed-content Łukasiewicz words
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Ranking and Unranking of Non-regular Trees
- A note on generating binary trees inA-order andB-order
- Generating trees withnnodes andmleaves
- A new algorithm for generating derangements
- Generation of binary trees from (0-1) codes
- Fast algorithms for genegrating integer partitions
- A note on the generation of binary trees
- Efficient enumeration of ordered trees with \(k\) leaves
- A constant amortized time algorithm for generating left-child sequences in lexicographic order
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Generating alternating permutations lexicographically
- Linear time tree codes
This page was built for publication: Generating Trees and Other Combinatorial Objects Lexicographically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192083)
