Broadcasting in heterogeneous tree networks
From MaRDI portal
Publication:3578337
DOI10.1007/978-3-642-14031-0_40zbMATH Open1286.68013OpenAlexW1525759649MaRDI QIDQ3578337FDOQ3578337
Authors: Yu-Hsuan Su, Ching-Chi Lin, Der-Tsai Lee
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_40
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cited In (16)
- Broadcasting in heterogeneous tree networks with uncertainty
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local broadcasting in a tree under minisum criterion
- Broadcasting in heterogeneous networks
- 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
- Broadcasting in weighted trees under the postal model
- Efficient broadcast trees for weighted vertices
- 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)