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

DOI10.1007/3-540-58218-5_20zbMath1502.68232OpenAlexW1567696985MaRDI QIDQ5054763

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

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_20

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Broadcast and gossip in line-communication mode ⋮ Gossiping in chordal rings under the line model ⋮ Efficient collective communciation in optical networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New gossips and telephones
• Optimal algorithms for dissemination of information in generalized communication modes
• 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
• Broadcasting in butterfly and debruijn networks

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