Pages that link to "Item:Q593988"
From MaRDI portal
The following pages link to The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988):
Displaying 11 items.
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- On the cut polytope (Q4726054) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- (Q5202209) (← links)
- On the bond polytope (Q6060889) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
- Canonical cuts of path powers (Q6641096) (← links)