Pages that link to "Item:Q5066939"
From MaRDI portal
The following pages link to Optimal Bounds for the <i>k</i> -cut Problem (Q5066939):
Displaying 6 items.
- Theoretical lower bound for border length minimization problem (Q2412793) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- (Q4944983) (← links)
- Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs (Q6083468) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
- Algorithms for the ferromagnetic Potts model on expanders (Q6632817) (← links)