Pages that link to "Item:Q2508334"

The following pages link to Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs (Q2508334):

Displaying 13 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)
• Note on the problem of gossiping in multidimensional grids (Q1339896) (← links)
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
• Minimum-cost line broadcast in paths (Q1363771) (← 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)
• 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)
• Gossiping in chordal rings under the line model (Q5941561) (← links)
• Communication in the two-way listen-in vertex-disjoint paths mode (Q5941562) (← links)