The following pages link to Graph bisection revisited (Q1657405):
Displaying 12 items.
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Bisection width of transposition graphs (Q1392578) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Better Bounds for Graph Bisection (Q2912858) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- (Q4260388) (← links)
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement (Q4389077) (← links)
- Solving Graph Bisection Problems with Semidefinite Programming (Q4427330) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)