Math: Combinatorics: Software

the entire directory only this category

Advanced Search

Home : Math : Combinatorics : Software

CATEGORIES:

Graph Drawing (22)

Linear Programming and Optimization (19)

LINKS:

ACE
http://phalanstere.univ-mlv.fr/~ace/ACE/3.0/ACE.html
An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download.

Algorithms and Software for Partitioning Meshes
http://www.cs.sandia.gov/CRF/chac.html
Using combinatorics to solve structured linear systems of equations.

Combinatorics Software of the Algorithms Project
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 recurrences; study their asymptotic behaviour.

Free Software in Graph Theory
http://www.geocities.com/pechv_ru/
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.

Gato: The Graph Animation Toolbox
http://www.zpr.uni-koeln.de/~gato
Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.

GeoSteiner
http://www.diku.dk/geosteiner/
Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve.

GOBLIN Graph Library
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.

GRAPE
http://www.maths.qmul.ac.uk/~leonard/grape/
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.

Graph Coloring By DSATUR
http://prolland.free.fr/works/research/dsatphp/dsat.html
By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format.

Graph Partitioners
http://www-2.cs.cmu.edu/~scandal/alg/separator.html
Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.

GraphThing
http://graph.seul.org/
Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.

Information System on Graph Class Inclusions
http://wwwteo.informatik.uni-rostock.de/isgci/
A java applet for researching what is known about particular graph classes.

JGraphT
http://jgrapht.sourceforge.net
Free Java class library that provides mathematical graph-theory objects and algorithms.

LINK: A Software System for Discrete Mathematics
http://dimacs.rutgers.edu/~berryj/LINK.html
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
http://www-users.cs.umn.edu/~karypis/metis/
Graph, mesh, and hypergraph partitioning software.

Nauty
http://cs.anu.edu.au/~bdm/nauty/
A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.

plantri and fullgen
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.

Project Vega
http://vega.ijp.si/Htmldoc/Vega03.html
A system for manipulating discrete mathematical structures: a Mathematica based collection of operations with interface to external packages and programs.

Scalable Libraries for Graph Partitioning
http://www.npac.syr.edu/NPAC1/PUB/ranka/part/part.html
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.

SF, Posets and Coxeter/Weyl
http://www.math.lsa.umich.edu/~jrs/maple.html
John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.

The LEDA Library
http://www.mpi-sb.mpg.de/LEDA/leda.html
LEDA is a library of the data types and algorithms of combinatorial computing.

HOME | ADD A LINK | MODIFY A LINK | LOGIN

� atomseek.com
Website Development by MIRO

UFO Seek Forum� is a growing community for discussion of UFO-Paranormal, mysterious and unexplained topics.