Pages that link to "Item:Q1827271"
From MaRDI portal
The following pages link to Optimal gossiping in paths and cycles (Q1827271):
Displaying 9 items.
- Communication complexity of gossiping by packets (Q1373799) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- Optimal gossip with direct addressing (Q2943620) (← links)
- (Q4519135) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906) (← links)
- Structural Information and Communication Complexity (Q5710091) (← links)
- Order optimal information spreading using algebraic gossip (Q5891123) (← links)