Broadcasting in heterogeneous tree networks
From MaRDI portal
Publication:3578337
Recommendations
Cited in
(16)- Broadcasting in heterogeneous tree networks with uncertainty
- scientific article; zbMATH DE number 6469246 (Why is no real title available?)
- scientific article; zbMATH DE number 3934937 (Why is no real title available?)
- Broadcasting in heterogeneous networks
- Local broadcasting in a tree under minisum criterion
- Broadcast problem in hypercube of trees
- Nonadaptive broadcasting in trees
- Optimum broadcasting in complete weighted-vertex graphs
- Finding broadcast 2-centers of a tree under the postal model
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- The complexity of finding a broadcast center
- The broadcast median problem in heterogeneous postal model
- Efficient broadcast trees for weighted vertices
- Broadcasting in weighted trees under the postal model
- Computation of broadcasting multiple messages in a positive weighted tree
- Broadcast with energy-exchanging mobile agents distributed on a tree
This page was built for publication: Broadcasting in heterogeneous tree networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578337)