### 抄録

Given an undirected graph G = (V,E) and a delta-matroid (V,F), the delta-matroid matching problem is to find a maximum cardinality matching M such that the set of the end vertices of M belongs to F. This problem is a natural generalization of the matroid matching problem to delta-matroids, and thus it cannot be solved in polynomial time in general. This paper introduces a class of the delta-matroid matching problem, where the given delta-matroid is a projection of a linear delta-matroid. We first show that it can be solved in polynomial time if the given linear delta-matroid is generic. This result enlarges a polynomially solvable class of matching problems with precedence constraints on vertices such as the 2-master/slave matching. In addition, we design a polynomial-time algorithm when the graph is bipartite and the delta-matroid is defined on one vertex side. This result is extended to the case where a linear matroid constraint is additionally imposed on the other vertex side.

元の言語 | English |
---|---|

ページ（範囲） | 942-961 |

ページ数 | 20 |

ジャーナル | SIAM Journal on Discrete Mathematics |

巻 | 28 |

発行部数 | 2 |

DOI | |

出版物ステータス | Published - 2014 |

外部発表 | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)

### これを引用

*SIAM Journal on Discrete Mathematics*,

*28*(2), 942-961. https://doi.org/10.1137/110860070

**Matching problems with delta-matroid constraints.** / Kakimura, Naonori; Takamatsu, Mizuyo.

研究成果: Article

*SIAM Journal on Discrete Mathematics*, 巻. 28, 番号 2, pp. 942-961. https://doi.org/10.1137/110860070

}

TY - JOUR

T1 - Matching problems with delta-matroid constraints

AU - Kakimura, Naonori

AU - Takamatsu, Mizuyo

PY - 2014

Y1 - 2014

N2 - Given an undirected graph G = (V,E) and a delta-matroid (V,F), the delta-matroid matching problem is to find a maximum cardinality matching M such that the set of the end vertices of M belongs to F. This problem is a natural generalization of the matroid matching problem to delta-matroids, and thus it cannot be solved in polynomial time in general. This paper introduces a class of the delta-matroid matching problem, where the given delta-matroid is a projection of a linear delta-matroid. We first show that it can be solved in polynomial time if the given linear delta-matroid is generic. This result enlarges a polynomially solvable class of matching problems with precedence constraints on vertices such as the 2-master/slave matching. In addition, we design a polynomial-time algorithm when the graph is bipartite and the delta-matroid is defined on one vertex side. This result is extended to the case where a linear matroid constraint is additionally imposed on the other vertex side.

AB - Given an undirected graph G = (V,E) and a delta-matroid (V,F), the delta-matroid matching problem is to find a maximum cardinality matching M such that the set of the end vertices of M belongs to F. This problem is a natural generalization of the matroid matching problem to delta-matroids, and thus it cannot be solved in polynomial time in general. This paper introduces a class of the delta-matroid matching problem, where the given delta-matroid is a projection of a linear delta-matroid. We first show that it can be solved in polynomial time if the given linear delta-matroid is generic. This result enlarges a polynomially solvable class of matching problems with precedence constraints on vertices such as the 2-master/slave matching. In addition, we design a polynomial-time algorithm when the graph is bipartite and the delta-matroid is defined on one vertex side. This result is extended to the case where a linear matroid constraint is additionally imposed on the other vertex side.

KW - Constrained matching

KW - Delta-matroid

KW - Mixed matrix theory

KW - Polynomial-time algorithm

UR - http://www.scopus.com/inward/record.url?scp=84904007381&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904007381&partnerID=8YFLogxK

U2 - 10.1137/110860070

DO - 10.1137/110860070

M3 - Article

AN - SCOPUS:84904007381

VL - 28

SP - 942

EP - 961

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -