Pages that link to "Item:Q1357008"

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

Displaying 7 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)
• 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)
• (Q4429298) (← 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)