Recommendations
Cited in
(20)- On the construction of regular minimal broadcast digraphs
- Minimum \(k\)-broadcast graphs
- Broadcasting multiple messages in the 1-in port model in optimal time
- The shortest path problem in the Knödel graph
- Modelling simultaneous broadcasting by level-disjoint partitions
- On equitable colouring of Knödel graphs
- Time-optimal broadcasting of multiple messages in 1-in port model
- Multi-messages broadcasting in simultaneously send/receive communication networks
- scientific article; zbMATH DE number 5139470 (Why is no real title available?)
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- Upper bounds on the broadcast function using minimum dominating sets
- Multiple message broadcasting in communication networks
- Total domination in cubic Knodel graphs
- Minimum multiple originator broadcast graphs
- Some properties of the Knödel graph W(k,2ᵏ), k 4
- Tight Bounds on Mimimum Broadcast Networks
- On broadcast schemes of Knödel graphs
- All sequential dimensional broadcast schemes in Knödel graphs
- All-to-all broadcast problems on Cartesian product graphs
- Broadcasting from multiple originators
This page was built for publication: Minimum multiple message broadcast graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487809)