Optimal algorithms for dissemination of information in generalized communication modes
From MaRDI portal
Publication:1339882
DOI10.1016/0166-218X(94)90179-1zbMath0823.68041MaRDI QIDQ1339882
Juraj Hromkovič, P. Mysliwietz, Rainer Feldmann, Burkhard Monien, Seshu Madhavapeddy
Publication date: 11 December 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (13)
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ Minimum-cost line broadcast in paths ⋮ Unnamed Item ⋮ The relationship between gossiping in vertex-disjoint paths mode and bisection width ⋮ Minimum-time multidrop broadcast ⋮ Line broadcasting in cycles ⋮ The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Communication in the two-way listen-in vertex-disjoint paths mode ⋮ Efficient collective communciation in optical networks
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel algorithms for gossiping by mail
- Gossips and telephones
- A survey of gossiping and broadcasting in communication networks
- Minimum-time line broadcast networks
- Virtual cut-through: A new computer communication switching technique
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- The shuffle exchange network has a Hamiltonian path
- A Cure for the Telephone Disease
This page was built for publication: Optimal algorithms for dissemination of information in generalized communication modes
