6533b82ffe1ef96bd129502c
RESEARCH PRODUCT
An efficient upper bound of the rotation distance of binary trees
Jean Marcel Pallosubject
Binary treeRegular polygonComputer Science::Computational GeometryUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYLattice (order)Signal ProcessingTime complexityComputingMethodologies_COMPUTERGRAPHICSInformation SystemsMathematicsdescription
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2000-02-01 | Information Processing Letters |