论文信息 - The linear delta-matroid parity problem

The linear delta-matroid parity problem

This paper addresses a generalization of the matroid parity problem to delta-matroids. We give a minimax relation, as well as an efficient algorithm, for linearly represented delta-matroids. These are natural extensions of the minimax theorem of Lovasz and the augmenting path algorithm of Gabow and Stallmann for the linear matroid parity problem.

[1] André Bouchet,et al. Coverings and Delta-Coverings , 1995, IPCO.

[2] László Lovász,et al. Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.

[3] Satoru Iwata,et al. Matroid Matching Via Mixed Skew-Symmetric Matrices , 2005, Comb..

[4] John H. Vande Vate,et al. Solving the linear matroid parity problem as a sequence of matroid intersection problems , 1990, Math. Program..

[5] Harold N. Gabow,et al. An augmenting path algorithm for linear matroid parity , 1986, Comb..

[6] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..

[7] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[8] André Bouchet,et al. Representability of △-matroids over GF(2) , 1991 .

[9] Ramaswamy Chandrasekaran,et al. Pseudomatroids , 1988, Discret. Math..

[10] Kazuo Murota,et al. Matrices and Matroids for Systems Analysis , 2000 .

[11] James G. Oxley,et al. Matroid theory , 1992 .

[12] Timothy F. Havel,et al. Some Combinatorial Properties of Discriminants in Metric Vector Spaces , 1986 .

[13] André Bouchet,et al. Greedy algorithm and symmetric matroids , 1987, Math. Program..

[14] Bernhard Korte,et al. Complexity of Matroid Property Algorithms , 1982, SIAM J. Comput..