Generating Trees and Other Combinatorial Objects Lexicographically

DOI10.1137/0208006zbMATH Open0406.05026OpenAlexW2093386412WikidataQ106202795 ScholiaQ106202795MaRDI QIDQ4192083FDOQ4192083

Authors:

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

Mathematics Subject Classification ID

Trees (05C05) Ordered sets (06A99)

Cited In (27)

• A note on generating binary trees inA-order andB-order
• A note on the generation of binary trees
• Generating trees withnnodes andmleaves
• Efficient tree decomposition of high-rank tensors
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Ranking and Unranking of Non-regular Trees
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
• A new algorithm for generating derangements
• Efficient enumeration of ordered trees with \(k\) leaves
• Generating alternating permutations lexicographically
• On a theorem of Chorneyko and Mohanty
• Generation of binary trees from (0-1) codes
• A shift Gray code for fixed-content Łukasiewicz words
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Lexicographic generation of ordered trees
• Generating permutations with given ups and downs
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications
• Listing and counting subtrees of equal size of a binary tree
• Finding parity difference by involutions
• Linear time tree codes
• The generation of random, binary unordered trees
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• Fast algorithms for genegrating integer partitions
• Generating binary trees of bounded height

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)