Pages that link to "Item:Q4192083"
From MaRDI portal
The following pages link to Generating Trees and Other Combinatorial Objects Lexicographically (Q4192083):
Displaying 27 items.
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
- Generating alternating permutations lexicographically (Q583885) (← links)
- Linear time tree codes (Q799118) (← links)
- Listing and counting subtrees of equal size of a binary tree (Q1055196) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Lexicographic generation of ordered trees (Q1133548) (← links)
- On a theorem of Chorneyko and Mohanty (Q1137997) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- Solution of some multi-dimensional lattice path parity difference recurrence relations (Q1264151) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- Efficient tree decomposition of high-rank tensors (Q2002458) (← links)
- A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Ranking and Unranking of Non-regular Trees (Q3792254) (← links)
- A note on generating binary trees in<i>A</i>-order and<i>B</i>-order (Q3802638) (← links)
- Generating trees with<i>n</i>nodes and<i>m</i>leaves (Q3805926) (← links)
- A new algorithm for generating derangements (Q3870323) (← links)
- Generation of binary trees from (0-1) codes (Q3989787) (← links)
- Fast algorithms for genegrating integer partitions (Q4236115) (← links)
- A note on the generation of binary trees (Q4285646) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
