Pages that link to "Item:Q1392537"

The following pages link to The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537):

Displaying 4 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)