Pages that link to "Item:Q3491599"

The following pages link to Generating binary trees by transpositions (Q3491599):

Displaying 18 items.

• Two shortest path metrics on well-formed parentheses strings (Q286951) (← links)
• On the loopless generation of binary tree sequences (Q293424) (← links)
• An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
• Generating alternating permutations lexicographically (Q583885) (← links)
• An improved kernel size for rotation distance in binary trees (Q763531) (← links)
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
• Gray coding cubic planar maps (Q906395) (← links)
• A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
• Uniform random generation of expressions respecting algebraic identities (Q1179541) (← links)
• A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
• Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
• Generating linear extensions of posets by transpositions (Q2368024) (← links)
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
• Towards a generic view of primality through multiset decompositions of natural numbers (Q2453539) (← links)
• Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
• The number of coverings in four catalan lattices (Q2710772) (← links)
• Emulating Primality with Multiset Representations of Natural Numbers (Q3105752) (← links)