On the monotonicity of the broadcast function
From MaRDI portal
Recommendations
- A note on monotonicity results in multicasting
- New lower bounds on broadcast function
- On the number of broadcast schemes in networks
- Monotonicity properties of cost functions in queueing networks
- Upper bounds on the broadcast function using minimum dominating sets
- Broadcasting in Bounded Degree Graphs
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
- Optimal and near-optimal broadcast in random graphs
- Improved upper and lower bounds for \(k\)-broadcasting
- On the optimality of general lower bounds for broadcasting and gossiping
Cited in
(11)- A linear algorithm for finding the k‐broadcast center of a tree
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- Binary linear programming models for robust broadcasting in communication networks
- The shortest path problem in the Knödel graph
- Upper bounds on the broadcast function using minimum dominating sets
- Broadcasting from multiple originators
- Diametral broadcast graphs
- All-to-all broadcast problems on Cartesian product graphs
- Efficient construction of broadcast graphs
- On broadcast schemes of Knödel graphs
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
This page was built for publication: On the monotonicity of the broadcast function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868844)
