The complexity of broadcasting in planar and decomposable graphs (Q1392535): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126464446, #quickstatements; #temporary_batch_1731336103896 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126464446 / rank | |||
Normal rank | |||
Latest revision as of 15:42, 11 November 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
