Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502)

The MINIMUM BROADCAST TIME (MBT) problems is whether a piece of information can be disseminated in a graph from a set of source nodes at all other nodes of the graph in at most \(k\) time steps. It is assumed that in one time step each node that contains the information can broadcast it to at most one of its neighbours. We show that MBT is NP- complete for 3-regular planar graphs and a constant deadline \(k\geq 2\).