Parameterized Complexity of Broadcasting in Graphs
From MaRDI portal
Parameterized Complexity of Broadcasting in Graphs
Recommendations
- Parameterized complexity of broadcasting in graphs
- The complexity of broadcasting in planar and decomposable graphs
- The complexity of broadcasting in planar and decomposable graphs
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- The minimum broadcast time problem for several processor networks
Cites work
- A survey of gossiping and broadcasting in communication networks
- An application of simultaneous diophantine approximation in combinatorial optimization
- Approximation Algorithms for Minimum-Time Broadcast
- Approximation algorithms in graphs with known broadcast time of the base graph
- 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.
- Exact exponential algorithms.
- Graph theory
- scientific article; zbMATH DE number 1875435 (Why is no real title available?)
- Improved upper bounds for vertex cover
- Information Dissemination in Trees
- Integer Programming with a Fixed Number of Variables
- Introduction to algorithms.
- Message Multicasting in Heterogeneous Networks
- Methods and problems of communication in usual networks
- Minimum-time line broadcast networks
- Minkowski's Convex Body Theorem and Integer Programming
- On broadcasting in unicyclic graphs
- Optimum broadcasting and personalized communication in hypercubes
- Parameterized algorithms
- Sublogarithmic approximation for telephone multicast
- The complexity of restricted spanning tree problems
- Tight Bounds on Mimimum Broadcast Networks
Cited in
(3)
This page was built for publication: Parameterized Complexity of Broadcasting in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496553)
