Pages that link to "Item:Q1357008"

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

Displaying 20 items.

• Random walks, bisections and gossiping in circulant graphs (Q486995) (← links)
• A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
• Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
• Broadcasting in \(m\)-dimensional grid graphs with a given neighborhood template (Q1339877) (← links)
• Optimal algorithms for dissemination of information in generalized communication modes (Q1339882) (← links)
• Note on optimal gossiping in some weak-connected graphs (Q1342244) (← 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)
• Lower bounds on systolic gossip (Q1763428) (← 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)
• Optimal gossiping in square 2D meshes (Q2382678) (← links)
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs (Q2508334) (← links)
• Almost-optimal gossip-based aggregate computation (Q2910849) (← links)
• The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
• (Q4429298) (← links)
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
• Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
• The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906) (← links)
• Communication in the two-way listen-in vertex-disjoint paths mode (Q5941562) (← links)