The whatUseek Directory

for

Home > Science > Math > Combinatorics >

Software

New! Submit a site

Categories:

Algebraic Combinatorics (2)		Linear Programming and Optimization (9)
Combinatorial Game Theory *(2)		Matroids and Set Systems (1)
Graph Drawing (11)

whatUseek Collection Sites (submit a site ):

Give your site great placement in this category in as little as two business days!

whatUseek Directory Site Listings:

Algorithms and Software for Partitioning Meshes - Using combinatorics to solve structured linear systems of equations.

Discreta - A program to construct t-designs with prescribed automorphism group.

Free Software on Graph theory - Free Software for Win 9X,NT on Graph Theory. Editor of the Graphs, Clipboard. Procedures: Metrics of the graph Paths and cycles Colorations Authomorphism group Minimal spanning tree Shortest paths Max. Capacity path K Shortest paths Salesman problem Maximal flow Critical path Reports for Graphs Print

Gato: The Graph Animation Toolbox - Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.

Graph Partitioners - Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.

GraphThing - Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C.

Groups & Graphs - Groups & Graphs is a software package for graphs, digraphs, combinatorial designs, and their automorphism groups.

LINK: A Software System for Discrete Mathematics - A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized.

METIS: Family of Multilevel Partitioning Algorithms - Graph, mesh, and hypergraph partitioning software.

Nauty - A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.

SF, Posets and Coxeter/Weyl - John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.

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.

The LEDA library - a library of the data types and algorithms ( number types and linear algebra, basic data types, dictionaries, graphs, geometry, graphics).

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.

Help build the largest human-edited directory on the web.

Submit a Site - Open Directory Project - Become an Editor

About Help Content Filter Terms Privacy Policy