Solving the linear matroid parity problem as a sequence of matroid intersection problems
暂无分享,去创建一个
[1] Bernhard Korte,et al. Complexity of Matroid Property Algorithms , 1982, SIAM J. Comput..
[2] M. Fujii,et al. Optimal Sequencing of Two Equivalent Processors , 1969 .
[3] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[4] Eugene L. Lawler,et al. Matroid intersection algorithms , 1975, Math. Program..
[5] Harold N. Gabow,et al. An augmenting path algorithm for linear matroid parity , 1986, Comb..
[6] László Lovász,et al. Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.
[7] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[8] Gérard Cornuéjols,et al. An extension of matching theory , 1986, J. Comb. Theory, Ser. B.
[9] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .
[10] Gérard Cornuéjols,et al. General factors of graphs , 1988, J. Comb. Theory, Ser. B.
[11] Rick Giles,et al. Optimum matching forests I: Special weights , 1982, Math. Program..
[12] John H. Vande Vate. Structural Properties of Matroid Matchings , 1992, Discret. Appl. Math..
[13] Harold N. Gabow,et al. An Augmenting Path Algorithm for the Parity Problem on Linear Matroids , 1984, FOCS.
[14] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[15] Gérard Cornuéjols,et al. Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem , 1983 .
[16] Gérard Cornuéjols,et al. Perfect triangle-free 2-matchings , 1980 .
[17] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..