DomainTools.com |
 |
||
|
|
||
Software
Directory > Science > Math > Combinatorics > Software
| Sort by |
| (Google PR) (Alphabetical) |
| Combinatorial_Game_Theory@ (2) | Design_Theory@ (2) | Graph_Drawing (38) |
| Linear_Programming_and_Optimization (38) | Matroids@ (3) |
| Related Categories: |
| Science > Math > Software (474) |
  By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format. |
LEDA is a library of the data types and algorithms of combinatorial computing. |
Using combinatorics to solve structured linear systems of equations. |
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. |
A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. |
A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized. |
Free Java class library that provides mathematical graph-theory objects and algorithms. |
Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs and Windows versions. |
A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats. |
A GAP package for computing with graphs; primarily designed for the efficient construction and analysis of graphs related to groups, combinatorial designs and finite geometries. |
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. |
Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++. |
Graph, mesh, and hypergraph partitioning software. |
Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts. |
John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups. |
Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve. |
A java applet for researching what is known about particular graph classes. |
C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms. |
Provides a fast graphisomorphism algorithm written in object-oriented Java using the popular yfiles graph library. The ITGI algorithm can be freely downloaded. |
An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download. |
A program for computing the maximal graphs using the star complement technique including programs for computing the maximal cliques and the isomorphism classes of graphs. |
NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. |
A tool for graph theory, having a generator and offering various algorithms: shortest paths, network flows, maximal clique, optimal coloring etc. |
| Help build the largest human-edited directory on the web. |
| Submit a Site - Open Directory Project - Become an Editor |
Domain Tools analysis of DMOZ top listed domains
