A note to non-adaptive broadcasting
From MaRDI portal
Publication:6536205
DOI10.1142/S0129626423400170MaRDI QIDQ6536205FDOQ6536205
Authors: Saber Gholami, Hovhannes A. Harutyunyan 
Publication date: 9 April 2024
Published in: Parallel Processing Letters (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- A survey of gossiping and broadcasting in communication networks
- Broadcast Networks of Bounded Degree
- Information Dissemination in Trees
- Approximation algorithms in graphs with known broadcast time of the base graph
- Sublogarithmic approximation for telephone multicast
- Title not available (Why is that?)
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- On broadcasting in unicyclic graphs
- An efficient heuristic for broadcasting in networks
- Approximation Algorithms for Minimum-Time Broadcast
- Title not available (Why is that?)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- Optimal algorithms for dissemination of information in some interconnection networks
- The complexity of broadcasting in planar and decomposable graphs
- Linear Algorithm for Broadcasting in Unicyclic Graphs
- Nonadaptive broadcasting in trees
- Broadcasting with universal lists
- Optimal broadcasting with universal lists based on competitive analysis*
- Title not available (Why is that?)
- Constant approximation for broadcasting in \(k\)-cycle graph
- Spanning tree modulus for secure broadcast games
Cited In (1)
This page was built for publication: A note to non-adaptive broadcasting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536205)
