The Fermat star of binary trees (Q987825): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075931019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient lower and upper bounds of the diagonal-flip distance between triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / 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
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank

Latest revision as of 02:52, 3 July 2024

scientific article
Language Label Description Also known as
English
The Fermat star of binary trees
scientific article

    Statements

    The Fermat star of binary trees (English)
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    0 references
    Fermat point
    0 references
    Fermat star
    0 references
    Steiner tree
    0 references
    binary tree
    0 references
    rotation distance
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references
    0 references