A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968)

From MaRDI portal
Revision as of 01:41, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7273084
Language Label Description Also known as
English
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
scientific article; zbMATH DE number 7273084

    Statements

    A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (English)
    0 references
    0 references
    0 references
    11 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed graph algorithms
    0 references
    minimum spanning tree
    0 references