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.