most citedOn a class of strong valid inequalities for the connected matching polytope

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2023

Polyhedral approach to weighted connected matchings in general graphs

Phillippe Samer, Phablo F. S. Moura

A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximu…