Work

Connected subgraphs, matching, and partitions

Year: 2024

Type: article

Abstract: Given an undirected graph [Formula: see text] 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 [Formula: see text]. 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 so-called matching-partition inequalities, which were introduced by Didi Biha, Kerivin and Ng [Polyhedral study of the connected subgraph problem, Discr. Math. 338 (2015) 80–92] for the connected subgraph polytope.

Source: Discrete Mathematics Algorithms and Applications

DOI: 10.1142/s1793830924501118

Authors: Mohamed Didi Biha, Hervé L. M. Kerivin

Institutions: Centre National de la Recherche Scientifique, Laboratoire de Mathématiques Nicolas Oresme, Université de Caen Normandie, Université Clermont Auvergne, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, Clemson University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4322486368

FWCI:

Cites: 8

Cited by:

Related to: 10