Name
Abstract | ||
|---|---|---|
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of this set have an endpoint in common. The variety of applications of this problem, along with the fact that several logic predicates can be modelled after it, motivates the study of a related global constraint in the context of Constraint Programming. In this work, we describe a filtering scheme for such a predicate based on matroids. Our method guarantees hyper-arc consistency in polynomial time. It is also applicable to any predicate expressed in terms of an independent system, and remains of polynomial complexity if there exists a polynomial time algorithm for finding a maximum cardinality basis of this independent system. Furthermore, we show that this filtering scheme can be employed to find a maximum cardinality matching. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.4304/jcp.1.6.37-42 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
matching, hyper-arc consistency, matroid intersection | Matroid,Discrete mathematics,Local consistency,Combinatorics,Matroid intersection,Existential quantification,Computer science,Constraint programming,Square-free polynomial,Cardinality,Time complexity | Journal |
Volume | Issue | ISSN |
1 | 6 | 1796-203X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitris Magos | 1 | 93 | 10.75 |
| Ioannis Mourtos | 2 | 72 | 13.99 |
| Leonidas S. Pitsoulis | 3 | 170 | 22.11 |