Optimal gossiping in paths and cycles (Q1827271)

From MaRDI portal
Revision as of 17:54, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal gossiping in paths and cycles
scientific article

    Statements

    title
    Optimal gossiping in paths and cycles (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    6 August 2004
    0 references
    zbMATH Keywords
    Gossiping
    0 references
    Analysis of algorithms
    0 references
    Information dissemination
    0 references
    Interconnection networks
    0 references

    Identifiers

    zbMATH DE Number
    2082303
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1827271&oldid=34365272"
    Powered by MediaWiki