42 citations · 59 across the 6 of their papers we have counts for
1 paper · 2 filters
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…