Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge Separators of Planar and Outerplanar Graphs With Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-time line broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for dissemination of information in generalized communication modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in butterfly and debruijn networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank

Latest revision as of 03:07, 31 July 2024

scientific article; zbMATH DE number 7631700
Language Label Description Also known as
English
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
scientific article; zbMATH DE number 7631700

    Statements