\(k\)-restricted rotation distance between binary trees (Q845999): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987293329 / rank
 
Normal rank
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: On the upper bound on the rotation distance of 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: Q4949795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 2 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-restricted rotation distance between binary trees
scientific article

    Statements

    \(k\)-restricted rotation distance between binary trees (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    rotation distance
    0 references
    binary tree
    0 references
    data structures
    0 references
    design of algorithms
    0 references

    Identifiers