Matrices with the edmonds—Johnson property
暂无分享,去创建一个
[1] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[2] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.
[3] Klaus Truemper,et al. A decomposition of the matroids with the max-flow min-cut property , 1986, Discret. Appl. Math..
[4] Klaus Truemper,et al. Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes , 1987, Math. Oper. Res..
[5] J. P. Uhry,et al. Transformations which Preserve Perfectness and H-Perfectness of Graphs , 1982 .
[6] J. P. Uhry,et al. A class of h-perfect graphs , 1984, Discret. Math..
[7] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[8] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[9] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[10] Mouloud Boulala,et al. Polytope des independants d'un graphe serie-parallele , 1979, Discret. Math..
[11] V. Chvátal. On certain polytopes associated with graphs , 1975 .