Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008)

From MaRDI portal
Revision as of 15:27, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Optimal algorithms for broadcast and gossip in the edge-disjoint modes
scientific article

    Statements

    title
    Optimal algorithms for broadcast and gossip in the edge-disjoint modes (English)
    0 references
    author
    Juraj Hromkovič
    0 references
    Ralf Klasing
    0 references
    Walter Unger
    0 references
    Hubert Wagener
    0 references
    publication date
    4 January 1998
    0 references
    zbMATH DE Number
    1022243
    0 references
    zbMATH Keywords
    gossip complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1357008&oldid=13496204"
    Powered by MediaWiki