|
Sponsored Links:
Graph Coloring By DSATUR (Popularity:  )
http://prolland.free.fr/works/research/dsatphp/dsat.html
By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format.
|
|
LINDO Optimization Modeling Tools (Popularity: )
http://www.lindo.com/
Software for linear, integer and nonlinear optimization. LINDO supplies large scale solvers with links to Excel and database applications.
|
|
Linear Programs Solvers (Popularity: )
http://home.ubalt.edu/ntsbarsh/Research/LpSolvers.htm
A free software package that solves linear programming models by the simplex and/or the push-and-pull methods.
|
|
TOMLAB - Matlab Optimization (Popularity: )
http://www.tomlab.BIZ
For fast and robust large-scale optimization in Matlab with interfaces to CPLEX, Xpress, MINOS, SNOPT and support for problems formulated in AMPL.
|
|
MOSEK Optimization Tools (Popularity: )
http://www.mosek.com
Software for solution of linear and nonlinear convex programming problems.
|
|
METIS: Family of Multilevel Partitioning Algorithms (Popularity: )
http://www-users.cs.umn.edu/~karypis/metis/
Graph, mesh, and hypergraph partitioning software.
|
|
Combinatorics Software of the Algorithms Project (Popularity: )
http://algo.inria.fr/libraries/software.html
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 ...
|
|
GOBLIN Graph Library (Popularity: )
http://www.math.uni-augsburg.de/opt/goblin.html
C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms.
|
|
Nauty (Popularity: )
http://cs.anu.edu.au/~bdm/nauty/
A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.
|
|
SolvOpt (Popularity: )
http://www.uni-graz.at/imawww/kuntsevich/solvopt/
Matlab, C, and Fortran codes to minimize nonlinear, possibly non-smooth objective functions and solve nonlinear minimization problems, taking into account constraints by the method of exact penalization.
|
|
GoVisual (Popularity: )
http://www.oreas.com
GoVisual-API is a library of layout algorithms that can be integrated into C++, .NET or Java applications. Includes advanced layout for UML diagrams and cluster diagrams.
|
|
The LEDA Library (Popularity: )
http://www.mpi-sb.mpg.de/LEDA/leda.html
LEDA is a library of the data types and algorithms of combinatorial computing.
|
|
SF, Posets and Coxeter/Weyl (Popularity: )
http://www.math.lsa.umich.edu/~jrs/maple.html
John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.
|
|
GraphThing (Popularity: )
http://graph.seul.org/
Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.
|
|
aiSee Graph Layout Software (Popularity: )
http://www.aisee.com/
aiSee automatically calculates a customizable layout of graphs specified in GDL (graph description language). aiSee supports 15 basic graph layout algorithms, recursive subgraph nesting, fish-eye views and easy printing. It ...
|
|
plantri and fullgen (Popularity: )
http://cs.anu.edu.au/people/bdm/plantri/
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.
|
|
Information System on Graph Class Inclusions (Popularity: )
http://wwwteo.informatik.uni-rostock.de/isgci/
A java applet for researching what is known about particular graph classes.
|
|
Algorithms and Software for Partitioning Meshes (Popularity: )
http://www.cs.sandia.gov/CRF/chac.html
Using combinatorics to solve structured linear systems of equations.
|
|
Nonlinear Optimization (Popularity: )
http://www.tolstykh.com
Nonlinear finite and infinite dimensional optimization, identification, methods and demo software by Prof. V. K. Tolstykh, Donetsk National University.
|
|
Annas Graph (Popularity: )
http://annas.googlecode.com
Annas is a Java framework designed for developers and researchers in the fields of Graph Theory - AI, Path finding, distributed systems, etc. At this point the framework is comprised ...
|
