Generating binary trees by transpositions

DOI10.1016/0196-6774(90)90030-IMaRDI QIDQ3491599zbMATH OpenOpenAlexFDO

Authors Frank Ruskey, Andrzej Proskurowski

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(90)90030-i

zbMATH Keywords

adjacent transposition graphalgorithmbinary treesbit stringsGray codestrong Gray code

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4062616
• Binary tree gray codes
• On Rotations and the Generation of Binary Trees
• A loopless Gray code for rooted trees
• Publication:4489211

Cited in

(33)

• Generating binary trees by Glivenko classes on Tamari lattices
• Uniform random generation of expressions respecting algebraic identities
• A loopless algorithm for generating binary tree sequences
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Finding parity difference by involutions
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Generating linear extensions of posets by transpositions
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Constructing a binary tree from its traversals by reversible recursion and iteration
• Towards a generic view of primality through multiset decompositions of natural numbers
• Flip-swap languages in binary reflected Gray code order
• The number of coverings in four catalan lattices
• Two shortest path metrics on well-formed parentheses strings
• On the loopless generation of binary tree sequences
• An Eades-McKay algorithm for well-formed parentheses strings
• A loopless Gray code for rooted trees
• Emulating primality with multiset representations of natural numbers
• scientific article; zbMATH DE number 5130543 (Why is no real title available?)
• Binary tree gray codes
• scientific article; zbMATH DE number 4062616 (Why is no real title available?)
• On the generation of binary trees inA-order
• On the generation of binary trees from (0–1) codes
• An improved algorithm for finding minimum-risk 3-state-device networks
• Adjacent interchange generation of combinations
• Generating alternating permutations lexicographically
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Greedy Gray codes for Dyck words and ballot sequences
• Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
• An improved kernel size for rotation distance in binary trees
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
• Gray coding cubic planar maps
• A general exhaustive generation algorithm for Gray structures

This page was built for publication: Generating binary trees by transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491599)