RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (Q4016895)

From MaRDI portal
scientific article
Language Label Description Also known as
English
RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
scientific article

    Statements

    RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (English)
    0 references
    0 references
    16 January 1993
    0 references
    euclidean minimum spanning tree
    0 references
    randomized algorithms
    0 references
    influence graph
    0 references
    skeleton
    0 references
    polygon
    0 references
    Delaunay triangulation
    0 references

    Identifiers