An optimal algorithm for broadcasting multiple messages in trees
From MaRDI portal
Recommendations
Cited in
(16)- Optimal and near-optimal algorithms for \(k\)-item broadcast
- Optimal point-to-point broadcast algorithms via lopsided trees
- Compact routing messages in self-healing trees
- Optimal multiple message broadcasting in telephone-like communication systems
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Computation of broadcasting multiple messages in a positive weighted tree
- Time-optimal broadcasting of multiple messages in 1-in port model
- Nonadaptive broadcasting in trees
- scientific article; zbMATH DE number 5139470 (Why is no real title available?)
- scientific article; zbMATH DE number 3934937 (Why is no real title available?)
- Optimal Linear Broadcast
- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
- scientific article; zbMATH DE number 2068168 (Why is no real title available?)
- Multiple message broadcasting in communication networks
- Optimal broadcasting with universal lists based on competitive analysis*
- Broadcasting two messages in wheel graphs
This page was built for publication: An optimal algorithm for broadcasting multiple messages in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970213)
