Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line dynamic maintenance of the width of a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of geometric extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Three-Dimensional Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the on-line closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining the minimal distance of a point set in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding range restriction capability to dynamic data structures / rank
 
Normal rank

Latest revision as of 12:21, 23 May 2024

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