Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Restricted rotation distance between binary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding restricted rotation distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for estimating rotation distance between two binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for restricted rotation distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound on the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient upper bound of the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right-arm rotation distance between binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank

Latest revision as of 10:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
scientific article

    Statements

    Efficient lower and upper bounds of the diagonal-flip distance between triangulations (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    triangulations
    0 references
    diagonal-flip distance
    0 references
    approximation algorithms
    0 references
    0 references