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; zbMATH DE number 1180308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of broadcasting in planar and decomposable graphs |
scientific article; zbMATH DE number 1180308 |
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
1.0000002
0 references
0.9051951
0 references
0.8958259
0 references
0 references
0.89366084
0 references
0.8863815
0 references
