scientific article; zbMATH DE number 1439421
From MaRDI portal
Publication:4949795
zbMath0968.05047MaRDI QIDQ4949795
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmtriangulationshortest pathbinary treediagonal flipsrotation graphcubic convex polyhedraminimum rotation distance
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (17)
Restricted rotation distance between k-ary trees ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Efficient lower and upper bounds of the diagonal-flip distance between triangulations ⋮ \(k\)-restricted rotation distance between binary trees ⋮ On the rotation distance between binary trees ⋮ A direct algorithm for restricted rotation distance ⋮ Lower bounds on the rotation distance of binary trees ⋮ Rotation sequences and edge-colouring of binary tree pairs ⋮ The Fermat star of binary trees ⋮ Rotation distance is fixed-parameter tractable ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Flip distances between graph orientations ⋮ Right-arm rotation distance between binary trees ⋮ Bounding restricted rotation distance ⋮ Rainbow Cycles in Flip Graphs. ⋮ Restricted rotation distance between binary trees.
This page was built for publication:
