Newsgroups: comp.ai.genetic,zer.z-netz.wissenschaft.informatik
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!EU.net!Germany.EU.net!zib-berlin.de!fauern!gs.dfn.de!news.uni-bielefeld.de!news
From: Goetz Weber <weber@phyaserv.uni-bielefeld.de>
Subject: Matching -- nonbipartite minimum weight
Sender: news@hermes.hrz.uni-bielefeld.de (News Administrator)
Message-ID: <D8q9tz.GB9@hermes.hrz.uni-bielefeld.de>
Date: Wed, 17 May 1995 15:03:34 GMT
Nntp-Posting-Host: phyaserv.uni-bielefeld.de
Organization: Universitaet Bielefeld, Rechenzentrum
Lines: 14

Hi!

I am looking for efficient implementations of the nonbipartite
(minimum weight) perfect matching problem i.e.
for 2N points, find the all matchings such that the overall length (cost 
being the Euclidean distance) is a minimum.
Has anyone got source code for this problem with known time bounds?
Perhaps in coded in C?

Any help is appreciated.

Thanks 
Goetz Weber

