Weighted Connected Matchings

Abstract

A matching M is a P-matching if the subgraph induced by the endpoints of the edges of M satisfies property P. As examples, for appropriate choices of P, the problems Induced Matching, Uniquely Restricted Matching, Connected Matching and Disconnected Matching arise. For many of these problems, finding a maximum P-matching is a knowingly NP-hard problem, with few exceptions, such as connected matchings, which has the same time complexity as the usual Maximum Matching problem. The weighted variant of Maximum Matching has been studied for decades, with many applications, including the well-known Assignment problem. Motivated by this fact, in addition to some recent researches in weighted versions of acyclic and induced matchings, we study the Maximum Weight Connected Matching. In this problem, we want to find a matching M such that the endpoint vertices of its edges induce a connected subgraph and the sum of the edge weights of M is maximum. Unlike the unweighted Connected Matching problem, which is in P for general graphs, we show that Maximum Weight Connected Matching is NP-hard even for bounded diameter bipartite graphs, starlike graphs, planar bipartite, and bounded degree planar graphs, while solvable in linear time for trees and subcubic graphs. When we restrict edge weights to be non negative only, we show that the problem turns to be polynomially solvable for chordal graphs, while it remains NP-hard for most of the cases when weights can be negative. Our final contributions are on parameterized complexity. On the positive side, we present a single exponential time algorithm when parameterized by treewidth. In terms of kernelization, we show that, even when restricted to binary weights, Weighted Connected Matching does not admit a polynomial kernel when parameterized by vertex cover under standard complexity-theoretical hypotheses.

Emparelhamento Conexo Ponderado é NP-completo

“…Neste artigo, mostramos que o EMPARELHAMENTO CONEXO PONDERADO é NPcompleto mesmo para grafos bipartidos de diâmetro quatro. Em [Gomes et al 2022], o problema é estudado em outras classes, assim como em duas versões: uma em que os pesos devem ser não negativos, e outra para pesos arbitrários. Em tal artigo, mostrase que o problema é NP-completo para grafos bipartidos planares, grafos planares de grau limitado, starlike, enquanto pertence a P para grafos com grau máximo 2 ou com treewidth limitada.…”