Directory of Software Resources

Home > Science > Math > Combinatorics > Software

This category is concerned with:

• application software dealing with combinatorial problems in a scientific scope.
• libraries of combinatorial algorithms which reflect the actual scientific state of the art.

Subcategories

• Combinatorial Game Theory
• Design Theory
• Graph Drawing
• Linear Programming and Optimization
• Matroids

Resources in This Category

• 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.

• Gato: The Graph Animation Toolbox

  http://gato.sourceforge.net/
  Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs and Windows versions.

• GeoSteiner

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

• GOBLIN Graph Library

  http://goblin2.sourceforge.net/
  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 Magics

  http://www.graph-magics.com/
  A tool for graph theory, having a generator and offering various algorithms: shortest paths, network flows, maximal clique, optimal coloring etc.

• Graph Partitioners

  http://www.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.

• graph-utils

  http://graph-utils.sourceforge.net/
  A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats.

• GraphThing

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

• Information-Theoretic GraphIsomorphism Algorithm

  http://www.itgi-algorithm.de/
  Provides a fast graphisomorphism algorithm written in object-oriented Java using the popular yfiles graph library. The ITGI algorithm can be freely downloaded.

• JGraphT

  http://jgrapht.org/
  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://glaros.dtc.umn.edu/gkhome/views/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.

• NetworkX

  http://networkx.github.io/
  NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.

• 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.

• SCL - Star Complement Library

  http://www.math.rs/~zstanic/scl.htm
  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.

• 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.

Related Categories

• Home > Science > Math > Software

 

Home > Science > Math > Combinatorics > Software

 

---

 

Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us