On the complexity of the shortest-path broadcast problem (Q896659)
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: On the complexity of the shortest-path broadcast problem |
scientific article; zbMATH DE number 6519406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the shortest-path broadcast problem |
scientific article; zbMATH DE number 6519406 |
Statements
On the complexity of the shortest-path broadcast problem (English)
0 references
10 December 2015
0 references
broadcast time
0 references
shortest paths
0 references
communication networks
0 references
layered graphs
0 references
0 references
0.9084997
0 references
0.8958259
0 references
0.8958259
0 references
0.8903413
0 references
0.88899565
0 references
0.8885024
0 references
0.8885024
0 references
0 references
0.88589716
0 references
