The complexity of broadcasting in planar and decomposable graphs (Q1392535)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of broadcasting in planar and decomposable graphs |
scientific article |
Statements
The complexity of broadcasting in planar and decomposable graphs (English)
0 references
2 December 1998
0 references
broadcasting
0 references
processor networks
0 references
