Optimal algorithms for broadcast and gossip in the edge-disjoint modes

DOI10.1006/inco.1996.2618zbMath0878.68070OpenAlexW1971853029MaRDI QIDQ1357008

Juraj Hromkovič, Walter Unger, Hubert Wagener, Ralf Klasing

Publication date: 4 January 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.2618

zbMATH Keywords

gossip complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (7)

Unnamed Item ⋮ The relationship between gossiping in vertex-disjoint paths mode and bisection width ⋮ The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Random walks, bisections and gossiping in circulant graphs ⋮ Lower bounds on systolic gossip ⋮ Communication in the two-way listen-in vertex-disjoint paths mode

Cites Work

• Unnamed Item
• Parallel algorithms for gossiping by mail
• New gossips and telephones
• Gossips and telegraphs
• Optimal algorithms for dissemination of information in some interconnection networks
• Optimal algorithms for dissemination of information in generalized communication modes
• Broadcasting in butterfly and deBruijn networks
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Minimum-time line broadcast networks
• Gossiping in Minimal Time
• Edge Separators of Planar and Outerplanar Graphs With Applications

This page was built for publication: Optimal algorithms for broadcast and gossip in the edge-disjoint modes