Posted by William Hsu (Director) on October 04, 2000 at 01:27:10:
In Reply to: Planar Graph Algorithms posted by Laura Kruse on September 28, 2000 at 11:50:37:
: Ok, maybe I just don't know where to look. But I can find all sorts of Graph Algorithms in LEDA. They even have one that will optomize a graph as the best it can, using Kuratowski-subgraphs. The problem is that I can't find any source code for these things. Does anyone have any suggestions? I can find a lot of the theortical mathmetical explination of how they should work, but I don't remember it all that well from my Combintorics class. Thanks.
Laura,
Please bring the LEDA documentation to the group meeting tomorrow. I'd like James (MLJ subgroup), Haipeng (Tools subgroup), and Yonghua (MLJ/Tools) to take a look at these algorithms.
Here are some online references:
http://www.ehess.fr/centres/cams/person/pom/pigale.html (LEDA-compatible implementation)
http://www.mpi-sb.mpg.de/LEDA/leda.html (LEDA home page)
NB to other KDD students - the LEDA graph library is to be distinguished from the Leda programming language.
Thanks,
WHH