1 The (Perfect) Matching Polytope. Let G = (V,E) be a graph. For U ⊆ V , we define δG(U) (or just δ(U)) to be the set of edges of G with exactly one ...
確定! 回上一頁