An algorithm for constructing minimal c-broadcast networks
From MaRDI portal
An algorithm for constructing minimal \(c\)-broadcast networks
Recommendations
Cites work
- A survey of gossiping and broadcasting in communication networks
- Antepenultimate broadcasting
- Bounded-call broadcasting
- Broadcasting in DMA-bound bounded degree graphs
- Compound constructions of broadcast networks
- Generalizations of broadcasting and gossiping
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Information Dissemination in Trees
- Minimum \(k\)-broadcast graphs
- Minimum broadcast graphs
- Tight Bounds on Mimimum Broadcast Networks
Cited in
(8)- Compound constructions of broadcast networks
- Minimum \(k\)-broadcast graphs
- Binary linear programming models for robust broadcasting in communication networks
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
- scientific article; zbMATH DE number 3948154 (Why is no real title available?)
- scientific article; zbMATH DE number 1532270 (Why is no real title available?)
- A linear algorithm for finding the k‐broadcast center of a tree
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
This page was built for publication: An algorithm for constructing minimal \(c\)-broadcast networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747800)