Persistency in maximum cardinality bipartite matchings

Authors:
Marie-Christine Costa
Affiliations:
Cedric, IIE-Conservatoire National des Arts et Métiers, 18 Allée Jean Rostand, BP 77, 91002 Evry cedex, France
Venue:
Operations Research Letters
Year:
1994

Citing 3
Cited 3

Efficient algorithms for finding maximum matching in graphs

ACM Computing Surveys (CSUR)
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn

Information Processing Letters
The uniquely solvable bipartite matching problem

Operations Research Letters

Generalised arc consistency for the AllDifferent constraint: An empirical survey

Artificial Intelligence
Finding all maximally-matchable edges in a bipartite graph

Theoretical Computer Science
The tractability of CSP classes defined by forbidden patterns

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G = (U, V, E) be an undirected bipartite graph. We specify some procedures that allow us to make efficiently the following 3-partition of the set E:E"1 is the set of edges belonging to all the maximum matchings (1-persistent edges); E"0 is the set of edges belonging to no maximum matching (0-persistent edges); E"w is the set of edges belonging to at least one maximum matching but not to all of them (weakly presistent edges).