Connected subgraphs, matching, and partitions - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

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.
Fichier principal
Vignette du fichier
Connected-Matching-Partition.pdf (250.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03963095 , version 1 (30-01-2023)

Identifiants

  • HAL Id : hal-03963095 , version 1

Citer

Mohamed Didi Biha, Hervé L M Kerivin. Connected subgraphs, matching, and partitions. 2023. ⟨hal-03963095⟩
16 Consultations
14 Téléchargements

Partager

Gmail Facebook X LinkedIn More