Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!crdgw1!uunet!brunix!man
From: man@cs.brown.edu (Mark H. Nodine)
Newsgroups: comp.theory
Subject: Mincost matching
Message-ID: <74305@brunix.UUCP>
Date: 2 May 91 19:34:57 GMT
Sender: news@brunix.UUCP
Reply-To: man@cs.brown.edu (Mark H. Nodine)
Organization: Brown University Department of Computer Science
Lines: 6

Does anybody by any chance have some C code that does a min-cost perfect
matching on a square costs matrix?  If so, I'd appreciate getting a copy.

Thanks.

	--Mark