Pages that link to "Item:Q3972008"
From MaRDI portal
The following pages link to Quick gossiping by multi-telegraphs (Q3972008):
Displaying 16 items.
- A class of solutions to the gossip problem. III (Q791539) (← links)
- Quick gossiping by telegraphs (Q1318840) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- Gossiping with multiple sends and receives (Q1917243) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- Lossy gossip and composition of metrics (Q2351025) (← links)
- Quick Gossiping by Conference Calls (Q3032285) (← links)
- (Q3318781) (← links)
- Gossiping in Minimal Time (Q3990105) (← links)
- Fast Gossiping by Short Messages (Q4210076) (← links)
- (Q4535804) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)