On Rotations and the Generation of Binary Trees

DOI10.1006/jagm.1993.1045zbMath0782.68090DBLPjournals/jal/LucasBR93OpenAlexW2019778981WikidataQ56534622 ScholiaQ56534622MaRDI QIDQ4275333

Frank Ruskey, Joan M. Lucas, Dominique Roelants van Baronaigien

Publication date: 23 January 1994

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

Full work available at URL: https://semanticscholar.org/paper/bdedb1c5e6c369d8195e8be0ab52380a78a583fc

zbMATH Keywords

binary treespointer machinerotation graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (37)

On the generation of binary trees inA-order ⋮ On the generation of binary trees from (0–1) codes ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ Shifts and loopless generation of \(k\)-ary trees ⋮ On the loopless generation of binary tree sequences ⋮ An Eades-McKay algorithm for well-formed parentheses strings ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ On the rotation distance between binary trees ⋮ Loop Free Generation ofK-Ary Trees ⋮ A direct algorithm for restricted rotation distance ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ The rotation distance of brooms ⋮ Unnamed Item ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Generating permutations of a bag by interchanges ⋮ A generic approach for the unranking of labeled combinatorial classes ⋮ Optimal binary search trees ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ On flips in planar matchings ⋮ Gray code enumeration of families of integer partitions ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Generating random binary trees -- a survey ⋮ Loopless Algorithms And SchrÖder Trees ⋮ An improved kernel size for rotation distance in binary trees ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.

This page was built for publication: On Rotations and the Generation of Binary Trees