scientific article; zbMATH DE number 1222822
From MaRDI portal
Publication:4218410
zbMath0910.68220MaRDI QIDQ4218410
Publication date: 14 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ Flip distance between two triangulations of a point set is NP-complete ⋮ Flip distance between triangulations of a planar point set is APX-hard ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Flip distances between graph orientations ⋮ Rainbow Cycles in Flip Graphs. ⋮ An efficient upper bound of the rotation distance of binary trees
This page was built for publication:
