Computing Euclidean maximum spanning trees (Q911288): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to search in history / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical clustering schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873762 / rank
 
Normal rank

Latest revision as of 14:06, 20 June 2024

scientific article
Language Label Description Also known as
English
Computing Euclidean maximum spanning trees
scientific article

    Statements

    Computing Euclidean maximum spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    spanning trees
    0 references
    furthest-neighbor graph
    0 references
    clusters
    0 references
    diameter-partitioning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references