scientific article; zbMATH DE number 1439421

MaRDI QIDQ4949795zbMATH OpenFDO

Authors Rodney O. Rogers

Publication date 18 September 2001

zbMATH Keywords

algorithmtriangulationshortest pathbinary treerotation graphdiagonal flipscubic convex polyhedraminimum rotation distance

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1161281
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• On the rotation distance between binary trees
• An efficient upper bound of the rotation distance of binary trees

Cited in

(19)

• Lower Bounds for Accessing Binary Search Trees with Rotations
• Rotation sequences and edge-colouring of binary tree pairs
• \(k\)-restricted rotation distance between binary trees
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• On the rotation distance between binary trees
• The Fermat star of binary trees
• Rotation distance is fixed-parameter tractable
• Bounding restricted rotation distance
• On flips in planar matchings
• Lower bounds on the rotation distance of binary trees
• Rotor-routing on Galton-Watson trees
• A direct algorithm for restricted rotation distance
• Restricted rotation distance between binary trees.
• Rainbow cycles in flip graphs
• Rainbow cycles in flip graphs
• Right-arm rotation distance between binary trees
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Restricted rotation distance between k-ary trees
• Flip distances between graph orientations

This page was built for publication:

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