The complexity of finding a broadcast center
From MaRDI portal
Publication:2151362
DOI10.1007/978-3-030-93176-6_6zbMath1498.68204OpenAlexW4205182679MaRDI QIDQ2151362
Hovhannes A. Harutyunyan, Zhi-yuan Li
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_6
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the broadcast function using minimum dominating sets
- Broadcasting on cactus graphs
- On broadcasting in unicyclic graphs
- Sparse broadcast graphs
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- Methods and problems of communication in usual networks
- Some minimum broadcast graphs
- More broadcast graphs
- A new construction of broadcast graphs
- A simple construction of broadcast graphs
- Efficient construction of broadcast graphs
- Broadcasting in Heterogeneous Tree Networks
- Linear Algorithm for Broadcasting in Unicyclic Graphs
- A survey of gossiping and broadcasting in communication networks
- On the construction of minimal broadcast networks
- Minimal broadcast networks
- Information Dissemination in Trees
- Antepenultimate broadcasting
- A linear algorithm for finding the k‐broadcast center of a tree
- Tight Bounds on Mimimum Broadcast Networks
- New Lower Bounds on Broadcast Function
- Broadcast Networks with Near Optimal Cost
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- A minimum broadcast graph on 26 vertices
This page was built for publication: The complexity of finding a broadcast center
