Messy broadcasting - decentralized broadcast schemes with limited knowledge
From MaRDI portal
Publication:628314
DOI10.1016/j.dam.2010.12.002zbMath1209.05253OpenAlexW2030626227MaRDI QIDQ628314
Hovhannes A. Harutyunyan, Arthur L. Liestman, Pavol Hell
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.002
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On randomized broadcasting in star graphs
- The shortest-path problem for graphs with random arc-lengths
- Methods and problems of communication in usual networks
- Deterministic broadcasting time with partial knowledge of the network.
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- On the Optimality of General Lower Bounds for Broadcasting and Gossiping
- Efficient communication in unknown networks
- The Structure of PEC Networks
- Randomized broadcast in networks
- A trade-off between information and communication in broadcast protocols
- Neighborhood Broadcasting in Hypercubes
- On Spreading a Rumor
- A survey of gossiping and broadcasting in communication networks
- Oracle size
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem