Generating binary trees by transpositions
From MaRDI portal
Publication:3491599
DOI10.1016/0196-6774(90)90030-IzbMath0709.05016OpenAlexW2066570077MaRDI QIDQ3491599
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
Related Items (22)
On the generation of binary trees inA-order ⋮ On the generation of binary trees from (0–1) codes ⋮ Two shortest path metrics on well-formed parentheses strings ⋮ Generating linear extensions of posets by transpositions ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ On the loopless generation of binary tree sequences ⋮ An Eades-McKay algorithm for well-formed parentheses strings ⋮ Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Fixed-parameter tractability of graph modification problems for hereditary properties ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Gray coding cubic planar maps ⋮ An improved algorithm for finding minimum-risk 3-state-device networks ⋮ The number of coverings in four catalan lattices ⋮ Towards a generic view of primality through multiset decompositions of natural numbers ⋮ Uniform random generation of expressions respecting algebraic identities ⋮ A loopless algorithm for generating binary tree sequences ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Generating alternating permutations lexicographically ⋮ A general exhaustive generation algorithm for Gray structures ⋮ An improved kernel size for rotation distance in binary trees ⋮ Emulating Primality with Multiset Representations of Natural Numbers
This page was built for publication: Generating binary trees by transpositions
