benson@nell.cs.umd.edu (Gary Benson) (03/26/91)
Does anyone have access to a program that does minimum weight matching on a general graph? That is, given a weighted graph, find a subset of edges such that every node is contained in exactly one edge and the weight of the set is minimal. I need a program for this to do some research and I would rather not rewrite a program if someone else already has it. Thanks.