Faster gossiping on butterfly networks (Q1770425): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Broadcasting and Gossiping in de Bruijn Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4870160 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quick gossiping by telegraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4536932 / rank | |||
Normal rank |
Latest revision as of 20:16, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster gossiping on butterfly networks |
scientific article |
Statements
Faster gossiping on butterfly networks (English)
0 references
6 April 2005
0 references
Algorithm
0 references
Routing
0 references
Gossiping
0 references
Network
0 references
Butterfly
0 references