Generating Trees and Other Combinatorial Objects Lexicographically
From MaRDI portal
Publication:4192083
DOI10.1137/0208006zbMath0406.05026OpenAlexW2093386412WikidataQ106202795 ScholiaQ106202795MaRDI QIDQ4192083
No author found.
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027/uiug.30112121956210
Related Items
Finding parity difference by involutions ⋮ Generation of binary trees from (0-1) codes ⋮ A note on the generation of binary trees ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ Lexicographic generation of ordered trees ⋮ On a theorem of Chorneyko and Mohanty ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Ranking and Unranking of Non-regular Trees ⋮ A note on generating binary trees inA-order andB-order ⋮ Generating trees withnnodes andmleaves ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Generating permutations with given ups and downs ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Efficient tree decomposition of high-rank tensors ⋮ Quasi-Monotonic Sequences: Theory, Algorithms and Applications ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Generating alternating permutations lexicographically ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ A new algorithm for generating derangements ⋮ Solution of some multi-dimensional lattice path parity difference recurrence relations ⋮ Listing and counting subtrees of equal size of a binary tree ⋮ Linear time tree codes ⋮ Generating binary trees of bounded height ⋮ Fast algorithms for genegrating integer partitions ⋮ The generation of random, binary unordered trees
