Pages that link to "Item:Q1339882"
From MaRDI portal
The following pages link to Optimal algorithms for dissemination of information in generalized communication modes (Q1339882):
Displaying 7 items.
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- Minimum-cost line broadcast in paths (Q1363771) (← links)
- Minimum-time multidrop broadcast (Q1392528) (← links)
- Line broadcasting in cycles (Q1392536) (← links)
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
