The complexity of broadcasting in planar and decomposable graphs (Q6184371)
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: The complexity of broadcasting in planar and decomposable graphs |
scientific article; zbMATH DE number 7784128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of broadcasting in planar and decomposable graphs |
scientific article; zbMATH DE number 7784128 |
Statements
The complexity of broadcasting in planar and decomposable graphs (English)
0 references
5 January 2024
0 references
graph algorithms
0 references
graph decomposition
0 references
computational complexity
0 references
