The complexity of broadcasting in planar and decomposable graphs (Q1392535)
From MaRDI portal
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
