Abstract
Consider a binary matroid $M$ given by its matrix representation. We show that if $M$ is a lift of a graphic or cographic matroid, then in polynomial time (in the size of $M$ and encoding length of the weights) we can either solve the single commodity-flow problem for $M$ or find an obstruction for which the max-flow min-cut relation does not hold. The key tool is an algorithmic version of Lehman's theorem for set covering polyhedra. This tool relies on the ellipsoid method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
