Broadcasting two messages in wheel graphs
From MaRDI portal
Cites work
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- A survey of gossiping and broadcasting in communication networks
- An efficient heuristic for broadcasting in networks
- An optimal algorithm for broadcasting multiple messages in trees
- Broadcast Time in Communication Networks
- Broadcasting multiple messages in a grid
- Broadcasting multiple messages in simultaneous send/receive systems
- scientific article; zbMATH DE number 3713780 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079323 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Information Dissemination in Trees
- Methods and problems of communication in usual networks
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- Multiple message broadcasting in communication networks
- Multiple message broadcasting in the postal model
- On broadcasting multiple messages in a \(d\)-dimensional grid
- Parameterized complexity of broadcasting in graphs
- Strong bounds and exact solutions to the minimum broadcast time problem
- The minimum broadcast time problem for several processor networks
- Tighter bounds on the minimum broadcast time
This page was built for publication: Broadcasting two messages in wheel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262719)
