Journal article

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.


  • There is no available fulltext. Please contact the lab or the authors.

Related material