Pages that link to "Item:Q1342244"
From MaRDI portal
The following pages link to Note on optimal gossiping in some weak-connected graphs (Q1342244):
Displaying 11 items.
- Label-connected graphs and the gossip problem (Q804593) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Note on the problem of gossiping in multidimensional grids (Q1339896) (← links)
- Periodic gossiping in back-to-back trees (Q1363646) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
- Some minimum gossip graphs (Q5289378) (← links)
- Cyclic gossiping times for some classes of graphs (Q5689808) (← links)