Recognizing max-flow min-cut path matrices

Authors:
David B Hartvigsen;Donald K Wagner
Affiliations:
Kellogg Graduate School of Management, Northwestern University, Evanston, IL 60201, USA;School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA
Venue:
Operations Research Letters
Year:
1988

Citing 4
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Recognizing planar perfect graphs

Journal of the ACM (JACM)
Max-flow min-cut matroids: polynomial testing and polynomial algorithms for maximum flow and shortest routes

Mathematics of Operations Research
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Seymour has introduced a class of matrices for which the polyhedron {x | Ax = 1, x = 0} has all integral extreme points. T main result of this paper is a polynomial-time algorithm for determining whether a given matrix is in this class.