## A note on the separation problem for the matching matroid

For a given graph G(V,E) and a given vector (......) the problem of finding a hyperplane which separates x form the polyhedron P of the matching matroid on G or proving that x belongs to P is solved by finding a minimum capacity cut on an auxiliary digraph.

Published in:
Discrete Mathematics, 52, 307-311
Year:
1984
Note:
PRO 307-311
Laboratories: