The minimal cost maximum matching of a graph (supplementary remarks)

Heiner Müller-Merbach. The minimal cost maximum matching of a graph (supplementary remarks). Math. Meth. of OR, 15(1):211-213, 1971. [doi]

Abstract

Abstract is missing.