Top : Science : Math : Combinatorics :
Software
Categories
| Combinatorial Game Theory @ Design Theory @ Graph Drawing Linear Programming and Optimization Matroids @ |
Websites
A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.
site exerpt
The nauty page Summary nauty is a program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. nauty is written in a portable subset of C, and runs on a considerable number of different systems. Documentation A...LEDA is a library of the data types and algorithms of combinatorial computing.
http://www.mpi-sb.mpg.de/LEDA/leda.html
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.
site exerpt
Software on Graph theory Warning! This home page contents Frames To view main page click Here...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.
http://www.npac.syr.edu/NPAC1/PUB/ranka/part/part.html
Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.
http://www.zpr.uni-koeln.de/~gato
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.
site exerpt
plantri and fullgen Graphs are generated in such a way that exactly one member of each isomorphism class is output without the need for storing them. The speed of generation is more than 100,000 graphs per second in most cases, so extremely large...Using combinatorics to solve structured linear systems of equations.
site exerpt
Algorithms and Software for Partitioning Meshes A decomposition of a finite element part prior to a parallel calculation. The different colored regions will be assigned to different processors. For high performance, the regions must be identically sized, and the interface between them (gray color) must be...Graph, mesh, and hypergraph partitioning software.
site exerpt
METIS: Family of Multilevel Partitioning Algorithms S is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality...John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.
site exerpt
SF, posets, coxeter, and weyl Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups Version 2.4 of coxeter and weyl is now available! The first updates for Maple 8 and 9 are in! The SF Package The posets Package The coxeter and...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.
site exerpt
Algolib: The Algorithms Project's Library and Other Packages of the Algorithms Project Combinatorics meets computer algebra! Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Project. Our packages let you specify, generate, and enumerate combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their...Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.
site exerpt
GraphThing Home Page Romanian version of this page c) 2001-2005 David Symonds Last Updated: 4 August 2005 Latest Version: 1.1 What is GraphThing Is it free Latest News What can GraphThing do Internationalisation Screenshots What do I need Downloads Mailing List What is...A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized.
site exerpt
DIMACS Projects: LINK K is a software system designed to be a general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized. The system features a full Scheme interpreter with access to the Tk...By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format.
site exerpt
Read a Dimacs graph with an URL Dimacs graph fixed with an URL Rolland-Balzon Philippe 04/2002 prolland@free.fr Dimacs Graph's URL: Matrix Display: Process Verbose: Color Verification: See 1. Dimacs Website Sources http mat.gsia.cmu.edu/COLOR/instances.html 2. Sources dsat.txt 3. How To :Algorithm...Free Java class library that provides mathematical graph-theory objects and algorithms.
site exerpt
Welcome to JGraphT a free Java Graph Library Java graph library that provides mathematical graph-theory objects and algorithms. JGraphT supports various types of graphs including: directed and undirected graphs. graphs with weighted unweighted labeled or any user-defined edges. various edge multiplicity options, including: simple-graphs, multigraphs, pseudographs. unmodifiable graphs...Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve.
site exerpt
GeoSteiner Homepage Steiner package solves the following NP-hard problems: Euclidean Steiner Tree Problem in the Plane Rectilinear Steiner Tree Problem in the Plane Minimum Spanning Tree Problem in Hypergraphs The code is written in ANSI C and requires no supplementary software or...A java applet for researching what is known about particular graph classes.
site exerpt
Information System on Graph Class Inclusions v2.0 I is a java applet that helps you to research what's known about particular graph classes. You can check the relation between graph classes draw clear inclusion diagrams colour these diagrams according to the complexity of selected problems find references...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.
site exerpt
GRAPE Package for GAP P root directory by this file. Description GRAPE is a GAP package for computing with graphs and groups, and is primarily designed for constructing and analysing graphs related to groups, finite geometries, and designs. The vast majority of GRAPE functions...C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms.
site exerpt
GOBLIN Download Page C class library focussed on graph optimization and network programming problems. It deals with all of the standard graph optimization problems discussed by textbooks and in courses on combinatorial optimization. This software package also consists of a shell interpreter which...An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download.
site exerpt
ACE 3.0 Main Page This is the definitive version of these Web pages and of the ACE 3.0 sources (February 1999 Voyez l'annonce du livre de Sbastien Veigneau Approches imprative et fonctionnelle de l'algorithmique, Applications en C et Caml-Light, qui inclut de nombreux exercices...Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
http://www-2.cs.cmu.edu/~scandal/alg/separator.html
A system for manipulating discrete mathematical structures: a Mathematica based collection of operations with interface to external packages and programs.
site exerpt
Project Vega Home Page Vega is a system for manipulating discrete mathematical structures. The ongoing project is located at the Department of Theoretical Computer Science at IMFM If you want to see and explore the list of functions currently available in Vega, go to...NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
http://networkx.sourceforge.net
Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
site exerpt
Graph Partitioners The goals of a graph partitioner, also called mesh partitioner, is to separate the vertices of a graph into almost equal-sized components such that the number of edges between components is minimized. Finding good graph partitions has been the focus...