The complexity of broadcasting in planar and decomposable graphs (Q1392535): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1166930 |
||
| Property / author | |||
| Property / author: K. Ruediger Reischuk / rank | |||
Revision as of 08:26, 22 February 2024
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
