Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
From MaRDI portal
Publication:5054763
DOI10.1007/3-540-58218-5_20zbMath1502.68232MaRDI 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
68W40: Analysis of algorithms
91D30: Social networks; opinion dynamics
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Gossiping in chordal rings under the line model, Broadcast and gossip in line-communication mode, 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