Connected subgraphs, matching, and partitions
Résumé
Given an undirected graph G and a real edge-weight vector, the connected subgraph problem consists of finding a maximum-weight subset of edges which induces a connected subgraph of G. In this paper, we establish a link between the complexity of the connected subgraph problem and the matching number. We study the separation problem associated with the Matching-partition inequalities wich are introduced by Didi Biha et al. [4] for the connected subgraph polytope.
Origine : Fichiers produits par l'(les) auteur(s)