Loading...
research article
A note on the separation problem for the matching matroid
Prodon, A.
1984
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.
Type
research article
Web of Science ID
WOS:A1984AAW2700021
Authors
Prodon, A.
Publication date
1984
Published in
Volume
52
Issue
2-3
Start page
307
End page
311
Note
PRO 307-311
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record