Broadcasting in weighted trees under the postal model (Q5964023): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message Multicasting in Heterogeneous Networks / rank
 
Normal rank
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: A Problem with Telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic approximation for telephone multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in Trees with Multiple Originators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized broadcast in 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: Improved upper and lower bounds fork-broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Broadcasting in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonadaptive broadcasting in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for finding the <i>k</i>‐broadcast center of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for broadcasting in networks / 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: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of broadcasting in planar and decomposable graphs / 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: Minimum \(k\)-broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Minimum-Time Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in DMA-bound bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Dissemination in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The broadcast median problem in heterogeneous postal model / rank
 
Normal rank

Latest revision as of 12:35, 11 July 2024

scientific article; zbMATH DE number 6546410
Language Label Description Also known as
English
Broadcasting in weighted trees under the postal model
scientific article; zbMATH DE number 6546410

    Statements

    Broadcasting in weighted trees under the postal model (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2016
    0 references
    algorithm
    0 references
    broadcast center
    0 references
    weighted tree
    0 references
    postal model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references