Finding Eulerian cycle decompositions and the rotation distance between binary trees

zbMATH Open1199.05002MaRDI QIDQ3406744FDOQ3406744

Authors: Gefry Barad 

Publication date: 19 February 2010

Recommendations

• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• scientific article; zbMATH DE number 1161281
• On the rotation distance between binary trees
• Sorting circular permutations by reversal.
• Rotation Distance, Triangulations, and Hyperbolic Geometry

zbMATH Keywords

rooted binary treesrotation distancesorting by reversalsbreakpoint graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (1)

• The Euclidean distortion of complete binary trees

This page was built for publication: Finding Eulerian cycle decompositions and the rotation distance between binary trees

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