Optimal gossiping in paths and cycles (Q1827271): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal sequential gossiping by short messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gossiping by Short Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential information dissemination by packets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Information Dissemination by Packets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Cost Trade-Offs in Gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast gossiping on square mesh computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gossiping for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank

Latest revision as of 17:54, 6 June 2024

scientific article
Language Label Description Also known as
English
Optimal gossiping in paths and cycles
scientific article

    Statements

    Optimal gossiping in paths and cycles (English)
    0 references
    0 references
    6 August 2004
    0 references
    Gossiping
    0 references
    Analysis of algorithms
    0 references
    Information dissemination
    0 references
    Interconnection networks
    0 references

    Identifiers