论文信息 - Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes

Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes

A polynomial test for deciding whether or not a given binary matroid has the max-flow min-cut property is described. In addition polynomial algorithms for finding shortest routes and extreme integral max flows in max-flow min-cut matroids are developed. The algorithms make use of a decomposition result for the max-flow min-cut matroids that was previously established in joint work with F.-T. Tseng. The max-flow algorithm also implies a strengthened version of P. D. Seymour's original characterization of the max-flow min-cut matroids.

Klaus Truemper | K. Truemper

[1] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[2] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[3] Klaus Truemper,et al. Polynomial algorithms for a class of linear programs , 1981, Math. Program..

[4] J. Edmonds,et al. A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.

[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[7] Klaus Truemper,et al. Local unimodularity of matrix-vector pairs , 1978 .

[8] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[9] Klaus Truemper,et al. A decomposition of the matroids with the max-flow min-cut property , 1986, Discret. Appl. Math..

[10] Henry J. Stephen Smith,et al. XV. On systems of linear indeterminate equations and congruences , 1861, Philosophical Transactions of the Royal Society of London.

[11] Robert E. Bixby,et al. ℓ-matrices and a Characterization of Binary Matroids , 1974, Discret. Math..

[12] Arie Tamir,et al. On the integrality of an extreme solution to pluperfect graph and balanced systems , 1984 .