1 paper
Luca Ferrarini, Samuel Fiorini, Stefan Kober +1
In the total matching problem, one is given a graph G with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incid…