Optimal algorithms for dissemination of information in some interconnection networks (Q1261287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Parallel algorithms for gossiping by mail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telegraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886878 / 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: A Cure for the Telephone Disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of broadcasting and gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in the butterfly network / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01908630 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088523482 / rank
 
Normal rank

Latest revision as of 08:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for dissemination of information in some interconnection networks
scientific article

    Statements

    Optimal algorithms for dissemination of information in some interconnection networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 1993
    0 references
    gossiping
    0 references
    broadcasting
    0 references
    one-way communication
    0 references
    lower bound
    0 references
    interconnection networks
    0 references

    Identifiers