Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!decwrl!deccrl!news.crl.dec.com!shlump.nac.dec.com!decuac!haven!mimsy!umiacs.umd.edu!samir
From: samir@umiacs.umd.edu (Samir Khuller)
Newsgroups: comp.theory
Subject: Looking for code
Message-ID: <31581@mimsy.umd.edu>
Date: 17 Mar 91 00:04:23 GMT
Sender: news@mimsy.umd.edu
Reply-To: samir@umiacs.umd.edu (Samir Khuller)
Organization: UMIACS, Univ. of Maryland, College Park, MD 20742
Lines: 11


I am interested in obtaining code for the following two problems:

1) Computing a minimum weight perfect matching in a graph.

2) Computing a delauney triangulation for a given set of points.

If anyone has any written (and tested) code for these problems, it will be 
really appreciated.
thanks, samir khuller
samir@umiacs.umd.edu