DeepAI AI Chat
Log In Sign Up

Diverse Pairs of Matchings

by   Fedor V. Fomin, et al.

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 second we show that Diverse Pair of Maximum Matchings is FPT parameterized by k. We round off the work by showing that Diverse Pair of Matchings has a kernel on 𝒪(k^2) vertices.


page 1

page 2

page 3

page 4


The Perfect Matching Cut Problem Revisited

In a graph, a perfect matching cut is an edge cut that is a perfect matc...

Diverse Collections in Matroids and Graphs

We investigate the parameterized complexity of finding diverse sets of s...

Red Domination in Perfect Elimination Bipartite Graphs

The k red domination problem for a bipartite graph G=(X,Y,E) is to find ...

The Perfect Matching Reconfiguration Problem

We study the perfect matching reconfiguration problem: Given two perfect...

The Complexity of Morality: Checking Markov Blanket Consistency with DAGs via Morality

A family of Markov blankets in a faithful Bayesian network satisfies the...

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Motivated by adjacency in perfect matching polytopes, we study the short...

Parameterized Algorithms for Diverse Multistage Problems

The world is rarely static – many problems need not only be solved once ...