All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494)
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: All-to-all broadcast problem of some classes of graphs under the half duplex all-port model |
scientific article; zbMATH DE number 6333600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-to-all broadcast problem of some classes of graphs under the half duplex all-port model |
scientific article; zbMATH DE number 6333600 |
Statements
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (English)
0 references
22 August 2014
0 references
all-to-all broadcast
0 references
broadcasting set
0 references
all-to-all broadcast number
0 references
tree
0 references
complete bipartite graph
0 references
double loop network
0 references
0 references
0.8870489001274109
0 references
0.7882277369499207
0 references
0.7786707282066345
0 references
0.7479720115661621
0 references
0.7468774318695068
0 references
