Almost Safe Gossiping in Bounded Degree Networks (Q4018844)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 90667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost Safe Gossiping in Bounded Degree Networks |
scientific article; zbMATH DE number 90667 |
Statements
Almost Safe Gossiping in Bounded Degree Networks (English)
0 references
16 January 1993
0 references
communication networks
0 references
gossip schemes
0 references
random faults
0 references
reliability
0 references
gossip problem
0 references
communication network
0 references
information
0 references
0.8512171506881714
0 references
0.8456253409385681
0 references
0.8175929188728333
0 references
0.8127992153167725
0 references
0.8127387762069702
0 references
