Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130)

From MaRDI portal
Revision as of 12:21, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic Euclidean minimum spanning trees and extrema of binary functions
scientific article

    Statements

    Dynamic Euclidean minimum spanning trees and extrema of binary functions (English)
    0 references
    0 references
    0 references
    20 March 1995
    0 references
    0 references
    spanning tree
    0 references
    ordered nearest neighbor path
    0 references
    dynamic algorithms
    0 references