Pages that link to "Item:Q1382273"
From MaRDI portal
The following pages link to Broadcast and gossip in line-communication mode (Q1382273):
Displaying 21 items.
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- Odd gossiping (Q516782) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← links)
- The addition game: An abstraction of a communication problem (Q1097184) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Fast information sharing in a complete network (Q1209151) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Periodic gossiping on trees (Q1339893) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- Periodic gossiping in back-to-back trees (Q1363646) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Hierarchical broadcast and gossip networks (Q1607034) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Faster gossiping on butterfly networks (Q1770425) (← links)
- A study of minimum gossip graphs (Q1974518) (← links)
- Gossip Latin square and the meet-all gossipers problem (Q2348701) (← links)
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- A survey of gossiping and broadcasting in communication networks (Q3795460) (← links)
- Fast Gossiping for the Hypercube (Q3990659) (← links)
- Minimum gossip bus networks (Q4887755) (← links)
