Pages that link to "Item:Q1392537"
From MaRDI portal
The following pages link to The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537):
Displaying 9 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)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs (Q2508334) (← 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)
- LATIN 2004: Theoretical Informatics (Q5901677) (← links)
