Broadcasting in unlabeled hypercubes with a linear number of messages.
From MaRDI portal
Publication:2583557
DOI10.1016/S0020-0190(98)00055-6zbMath1078.68534MaRDI QIDQ2583557
Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ružička, Krzysztof Diks
Publication date: 17 January 2006
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (4)
Efficient communication in unknown networks ⋮ Impact of topographic information on graph exploration efficiency ⋮ A note on leader election in directed split-stars and directed alternating group graphs ⋮ Sense of direction in distributed computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect broadcasting in unlabeled networks
- Computing Boolean functions on anonymous networks
- Distributed Computing on Anonymous Hypercube Networks
- Better computing on the anonymous ring
- A survey of gossiping and broadcasting in communication networks
- Computing on an anonymous ring
This page was built for publication: Broadcasting in unlabeled hypercubes with a linear number of messages.