Broadcasting in weighted trees under the postal model
From MaRDI portal
Publication:5964023
DOI10.1016/j.tcs.2016.01.031zbMath1335.68008MaRDI QIDQ5964023
Der-Tsai Lee, Yu-Hsuan Su, Ching-Chi Lin
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.031
05C05: Trees
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Broadcasting in DMA-bound bounded degree graphs
- Methods and problems of communication in usual networks
- Minimum \(k\)-broadcast graphs
- The complexity of broadcasting in planar and decomposable graphs
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- The broadcast median problem in heterogeneous postal model
- An efficient heuristic for broadcasting in networks
- Sublogarithmic approximation for telephone multicast
- Gossips and telephones
- Improved upper and lower bounds fork-broadcasting
- k-Broadcasting in trees
- Nonadaptive broadcasting in trees
- Randomized broadcast in networks
- A survey of gossiping and broadcasting in communication networks
- Information Dissemination in Trees
- Broadcasting in Trees with Multiple Originators
- A Problem with Telephones
- Designing broadcasting algorithms in the postal model for message-passing systems
- Message Multicasting in Heterogeneous Networks
- Approximation Algorithms for Minimum-Time Broadcast
- A linear algorithm for finding the k‐broadcast center of a tree
- Information dissemination in trees with nonuniform edge transmission times
