Optimal gossiping in paths and cycles (Q1827271)
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: Optimal gossiping in paths and cycles |
scientific article; zbMATH DE number 2082303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal gossiping in paths and cycles |
scientific article; zbMATH DE number 2082303 |
Statements
Optimal gossiping in paths and cycles (English)
0 references
6 August 2004
0 references
Gossiping
0 references
Analysis of algorithms
0 references
Information dissemination
0 references
Interconnection networks
0 references
0.9193239
0 references
0.9141015
0 references
0.9049789
0 references
0.8954307
0 references
0.89351964
0 references
0.89337474
0 references
0.8931887
0 references
