samir@umiacs.umd.edu (Samir Khuller) (03/17/91)
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