Pages that link to "Item:Q4275333"

The following pages link to On Rotations and the Generation of Binary Trees (Q4275333):

Displaying 37 items.

• Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
• On the loopless generation of binary tree sequences (Q293424) (← links)
• An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• An improved kernel size for rotation distance in binary trees (Q763531) (← links)
• On the rotation distance between binary trees (Q846983) (← links)
• Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
• Generating permutations of a bag by interchanges (Q1197979) (← links)
• Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
• On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• Gray code enumeration of families of integer partitions (Q1805052) (← links)
• Generating random binary trees -- a survey (Q1818783) (← links)
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
• Combinatorial generation via permutation languages. II. Lattice congruences (Q2055278) (← links)
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
• A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
• A direct algorithm for restricted rotation distance (Q2390238) (← links)
• A generic approach for the unranking of labeled combinatorial classes (Q2772928) (← links)
• A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
• The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
• Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
• On the generation of binary trees in<i>A</i>-order (Q4254656) (← links)
• On the generation of binary trees from (0–1) codes (Q4256127) (← links)
• Loopless Algorithms And SchrÖder Trees (Q4464414) (← links)
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
• Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
• (Q5013818) (← links)
• An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
• Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
• Optimal binary search trees (Q5906917) (← links)
• On flips in planar matchings (Q5919054) (← links)
• Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
• The rotation distance of brooms (Q6201876) (← links)