Minimizing broadcast costs under edge reductions in tree networks (Q1283789): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Designing broadcasting algorithms in the postal model for message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Time in Communication Networks / 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: Edge Weight Reduction Problems in Directed Acyclic Graphs / 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: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information dissemination in trees with nonuniform edge transmission times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving spanning trees by upgrading nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network upgrading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Dissemination in Trees / rank
 
Normal rank

Latest revision as of 18:14, 28 May 2024

scientific article
Language Label Description Also known as
English
Minimizing broadcast costs under edge reductions in tree networks
scientific article

    Statements

    Identifiers