Corpus ID: 221586111

Diverse Pairs of Matchings

  title={Diverse Pairs of Matchings},
  author={F. Fomin and P. A. Golovach and L. Jaffke and G. Philip and Danil Sagunov},
  • F. Fomin, P. A. Golovach, +2 authors Danil Sagunov
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • 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

    Figures from this paper.


    Publications referenced by this paper.
    An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
    • 2,167
    • PDF
    Combinatorial optimization. Polyhedra and efficiency.
    • 3,241
    • PDF
    Paths, Trees, and Flowers
    • 2,151
    • PDF
    Maximum matchings via Gaussian elimination
    • 270
    • PDF
    On Representatives of Subsets
    • 1,661
    • PDF
    Faster scaling algorithms for general graph matching problems
    • 294
    • PDF
    Splitters and near-optimal derandomization
    • 290
    • PDF
    The NP-Completeness of Edge-Coloring
    • 1,073
    • Highly Influential
    • PDF
    A short proof of the factor theorem for finite graphs
    • 247
    • PDF
    Maximum Matchings in General Graphs Through Randomization
    • 101
    • PDF