Pages that link to "Item:Q683339"
From MaRDI portal
The following pages link to The MIN-cut and vertex separator problem (Q683339):
Displaying 9 items.
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Graph bisection revisited (Q1657405) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)