scientific article; zbMATH DE number 1418487

zbMath0955.68122MaRDI QIDQ4942049

Sabine Hanke, Sven Schuierer, Thomas Ottmann

Publication date: 19 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edge-flipping operation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (21)

The pruning-grafting lattice of binary trees ⋮ Efficient lower and upper bounds of the diagonal-flip distance between triangulations ⋮ On the rotation distance between binary trees ⋮ Flip graphs of bounded degree triangulations ⋮ The phagocyte lattice of Dyck words ⋮ Computing the flip distance between triangulations ⋮ A quadratic distance bound on sliding between crossing-free spanning trees ⋮ Flip distance between triangulations of a simple polygon is NP-complete ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Flip distance between two triangulations of a point set is NP-complete ⋮ Flip distance between triangulations of a planar point set is APX-hard ⋮ Edge Conflicts do not Determine Geodesics in the Associahedron ⋮ Flipping in spirals ⋮ Flips in planar graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ Rainbow Cycles in Flip Graphs. ⋮ Restricted rotation distance between binary trees. ⋮ A Motzkin filter in the Tamari lattice ⋮ An efficient algorithm for enumeration of triangulations ⋮ Motzkin subposets and Motzkin geodesics in Tamari lattices. ⋮ An efficient upper bound of the rotation distance of binary trees

This page was built for publication: