Persistency in maximum cardinality bipartite matchings

This publication has 4 references indexed in Scilit:

• The uniquely solvable bipartite matching problem
  Operations Research Letters, 1991
• Computing a maximum cardinality matching in a bipartite graph in time O(n1.5mlog n)
  Information Processing Letters, 1991
• Efficient algorithms for finding maximum matching in graphs
  ACM Computing Surveys, 1986
• Rank of maximum matchings in a graph
  Mathematical Programming, 1982