A decomposition of the matroids with the max-flow min-cut property
暂无分享,去创建一个
[1] Klaus Truemper,et al. Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes , 1987, Math. Oper. Res..
[2] Paul D. Seymour,et al. Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.
[3] K. TRUEMPER,et al. A decomposition theory for matroids III. Decomposition conditions , 1986, J. Comb. Theory, Ser. B.
[4] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.
[5] Klaus Truemper,et al. A decomposition theory for matroids. II. Minimal violation matroids , 1985, J. Comb. Theory, Ser. B.
[6] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[7] W. T. Tutte. A homotopy theorem for matroids. II , 1958 .
[8] J. Edmonds,et al. A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.
[9] Klaus Truemper,et al. Partial Matroid Representations , 1984, Eur. J. Comb..
[10] Klaus Truemper,et al. A decomposition theory for matroids. I. General results , 1985, J. Comb. Theory, Ser. B.
[11] Klaus Truemper,et al. Local unimodularity of matrix-vector pairs , 1978 .
[12] Stein Krogdahl. The dependence graph for bases in matroids , 1977, Discret. Math..
[13] W. T. Tutte. Connectivity in Matroids , 1966, Canadian Journal of Mathematics.
[14] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[15] D. R. Fulkerson,et al. Flows in Networks. , 1964 .