Broadcasting under structural restrictions
From MaRDI portal
Cites work
- \textsc{Telephone Broadcast} on graphs of treewidth two
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- A faster algorithm for vertex cover parameterized by solution size
- A linear-time optimal broadcasting algorithm in stars of cliques
- A survey of gossiping and broadcasting in communication networks
- An approximation algorithm for the directed telephone multicast problem
- Approximation Algorithms for Minimum-Time Broadcast
- Broadcast graph is NP-complete
- Broadcasting in split graphs
- Broadcasting on cactus graphs
- Constant approximation for broadcasting in k-cycle graph
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Graph theory
- scientific article; zbMATH DE number 1670545 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved upper bounds for vertex cover
- Information Dissemination in Trees
- Message Multicasting in Heterogeneous Networks
- Methods and problems of communication in usual networks
- Minimum-time line broadcast networks
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- On broadcasting in unicyclic graphs
- On the computational complexity of vertex integrity and component order connectivity
- Parameterized algorithms
- Parameterized complexity of broadcasting in graphs
- Sublogarithmic approximation for telephone multicast
- The complexity of restricted spanning tree problems
- The minimum broadcast time problem for several processor networks
- The telephone \(k\)-multicast problem
- Tight Bounds on Mimimum Broadcast Networks
This page was built for publication: Broadcasting under structural restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310210)
