Pages that link to "Item:Q5054763"

The following pages link to Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763):

Displaying 14 items.

• OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
• Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
• Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
• Broadcast and gossip in line-communication mode (Q1382273) (← 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)
• Hierarchical broadcast and gossip networks (Q1607034) (← links)
• Optimal gossiping in paths and cycles (Q1827271) (← links)
• Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (Q1939254) (← links)
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs (Q2508334) (← links)
• (Q4429298) (← links)
• The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906) (← links)
• Gossiping in chordal rings under the line model (Q5941561) (← links)