Reduction used to transform the maximum weight f-matching problem to the maximum weight matching problem. Edge weights are all one, unless otherwise indicated, and f is given by the white dots inside the nodes. The total edge weight in G is 8. The solid edges show a maximum weight f-matching in G (w = 6), and a corresponding maximum weight matching in G' (of weight 6 + 8 = 14).
Maňuch et al. BMC Bioinformatics 2012 13(Suppl 19):S11 doi:10.1186/1471-2105-13-S19-S11