A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.
LEDA is a library of the data types and algorithms of combinatorial computing.
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.
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.
Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.
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.
Using combinatorics to solve structured linear systems of equations.
Graph, mesh, and hypergraph partitioning software.
John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.
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.
Science /
Math /
Software
|