1 paper
Florin Dobrian, Mahantesh Halappanavar, Alex Pothen +1
We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the we…