| 1. | Nauty | | | A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.
cs.anu.edu.au |
| 2. | Free Software in Graph Theory | | | Free Software for Win 9X,NT on Graph Theory by Vitali Petchenkine. Procedures: Metrics of the graph; Paths and cycles; Colorations; Automorphism group; Minimal spanning tree; Shortest paths; Max. Capacity path; K Shortest paths; Salesman problem; Maximal flow; Critical path; Reports for Graphs; Print.
www.geocities.com |
| 3. | Scalable Libraries for Graph Partitioning | | | We are pursuing research in the area of new parallel methods for graph partitioning and incremental graph partitioning. Efficient methods for graph partitioning and incremental graph partitioning are important for parallelization of a large number of unstructured and/or adaptive applications.
www.npac.syr.edu |
| 4. | plantri and fullgen | | | Programs for generation of certain types of planar graph, generated in such a way that exactly one member of each isomorphism class is output without the need for storing them.
cs.anu.edu.au |
| 6. | SF, Posets and Coxeter/Weyl | | | John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.
www.math.lsa.umich.edu |
| 7. | Graph Partitioners | | | Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
www.cs.cmu.edu |
| 8. | Combinatorics Software of the Algorithms Project | | | Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Projects. The packages let you define combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour.
algo.inria.fr |
| 9. | GraphThing | | | Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.
graph.seul.org |
| 10. | ACE | | | An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download.
phalanstere.univ-mlv.fr |
| 12. | Project Vega | | | A system for manipulating discrete mathematical structures: a Mathematica based collection of operations with interface to external packages and programs.
vega.ijp.si |
| 13. | JGraphT | | | Free Java class library that provides mathematical graph-theory objects and algorithms.
jgrapht.sourceforge.net |
| | |