Given a graph G=(V,E) and a set S ⊆V2 of terminal
pairs, the minimum mul...
Given a graph G=(V,E), the maximum bond problem searches for a maximum c...
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
The cut polytope of a graph G is the convex hull of the indicator vector...