Bounds for algebraic gossip on graphs (Q2925522)
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: Bounds for algebraic gossip on graphs |
scientific article; zbMATH DE number 6356975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for algebraic gossip on graphs |
scientific article; zbMATH DE number 6356975 |
Statements
Bounds for algebraic gossip on graphs (English)
0 references
16 October 2014
0 references
gossip
0 references
algebraic gossip
0 references
network coding
0 references
gossip algorithms
0 references
network capacity
0 references
0.8302042484283447
0 references
0.8292033672332764
0 references
0.777993381023407
0 references
0.7748889327049255
0 references
0.7673102617263794
0 references
