# Diverse Pairs of Matchings

@article{Fomin2020DiversePO, title={Diverse Pairs of Matchings}, author={F. Fomin and P. A. Golovach and L. Jaffke and G. Philip and Danil Sagunov}, journal={ArXiv}, year={2020}, volume={abs/2009.04567} }

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of Matchings (asking for two not necessarily maximum or perfect matchings) is NP-complete on general graphs if $k$ is part of the input, and we consider two restricted variants. First, we show that on bipartite graphs, the problem is polynomial-time solvable, and… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 33 REFERENCES

An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs

- Mathematics, Computer Science
- 1973

- 2,167
- PDF

Faster scaling algorithms for general graph matching problems

- Mathematics, Computer Science
- 1991

- 294
- PDF