Randomized minimum spanning tree algorithms using exponentially fewer random bits (Q4962697)

From MaRDI portal
Revision as of 01:00, 14 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6972855
Language Label Description Also known as
English
Randomized minimum spanning tree algorithms using exponentially fewer random bits
scientific article; zbMATH DE number 6972855

    Statements

    Randomized minimum spanning tree algorithms using exponentially fewer random bits (English)
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    minimum spanning trees
    0 references
    random sampling
    0 references