Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 |
scientific article; zbMATH DE number 417408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 |
scientific article; zbMATH DE number 417408 |
Statements
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (English)
0 references
17 October 1993
0 references
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\).
0 references
NP-completeness
0 references
information dissemination
0 references
combinatorial optimization
0 references
