Wectar - Science - Math - Combinatorics - Software

	submit a site to this category
	wectar web site suggestions for this odp category

Subcategories
Combinatorial Game Theory@	Design Theory@	Graph Drawing	Linear Programming and Optimization	Matroids@


Page		1	2

	GraphThing URL: http://graph.seul.org/ ODP description: Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++. Page title: GraphThing Home Page
	Nauty URL: http://cs.anu.edu.au/~bdm/nauty/ ODP description: A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. Page title: The nauty page
	GOBLIN Graph Library URL: http://www.math.uni-augsburg.de/opt/goblin.html ODP description: C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms. Page title: Weiterleitung Goblin Page description: Weiterleitung Goblin
	LINK: A Software System for Discrete Mathematics URL: http://dimacs.rutgers.edu/~berryj/LINK.html ODP description: A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized. Page title: DIMACS Projects: LINK
	The LEDA Library URL: http://www.mpi-sb.mpg.de/LEDA/leda.html ODP description: LEDA is a library of the data types and algorithms of combinatorial computing. Page title: LEDA moved to Algorithmic Solutions Software GmbH Page description: LEDA moved to AS
	GeoSteiner URL: http://www.diku.dk/geosteiner/ ODP description: Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve. Page title: GeoSteiner Homepage
	Free Software in Graph Theory URL: http://www.geocities.com/pechv_ru/ ODP description: 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. Page title: Software on Graph theory Page description: This page is about graph and network theory. Software on graph theory - visual editor of the graphs, solver of problems (metrics of the graph, cycles, optimization problems)
	Graph Partitioners URL: http://www.cs.cmu.edu/~scandal/alg/separator.html ODP description: Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
	SF, Posets and Coxeter/Weyl URL: http://www.math.lsa.umich.edu/~jrs/maple.html ODP description: John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups. Page title: SF, posets, coxeter, and weyl
	Algorithms and Software for Partitioning Meshes URL: http://www.cs.sandia.gov/CRF/chac.html ODP description: Using combinatorics to solve structured linear systems of equations.
	Information System on Graph Class Inclusions URL: http://wwwteo.informatik.uni-rostock.de/isgci/ ODP description: A java applet for researching what is known about particular graph classes. Page title: Information System on Graph Class Inclusions v2.0
	Graph Coloring By DSATUR URL: http://prolland.free.fr/works/research/dsatphp/dsat.html ODP description: By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format. Page title: Read a Dimacs graph with an URL
	METIS: Family of Multilevel Partitioning Algorithms URL: http://www-users.cs.umn.edu/~karypis/metis/ ODP description: Graph, mesh, and hypergraph partitioning software. Page title: METIS - Family of Multilevel Partitioning Algorithms \| Karypis Lab
	ACE URL: http://phalanstere.univ-mlv.fr/~ace/ACE/3.0/ACE.html ODP description: An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download. Page title: ACE 3.0 Main Page
	plantri and fullgen URL: http://cs.anu.edu.au/people/bdm/plantri/ ODP description: 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.
	JGraphT URL: http://jgrapht.sourceforge.net ODP description: Free Java class library that provides mathematical graph-theory objects and algorithms. Page title: Welcome to JGraphT - a free Java Graph Library
	graph-utils URL: http://graph-utils.sourceforge.net ODP description: A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats. Page title: SourceForge.net: graph-utils Page description: The world's largest development and download repository of Open Source code and applications
	GRAPE URL: http://www.maths.qmul.ac.uk/~leonard/grape/ ODP description: 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. Page title: GRAPE Package for GAP Page description: Homepage of the GRAPE package for GAP.
	Graph Magics URL: http://www.graph-magics.com ODP description: A tool for graph theory, having a generator and offering various algorithms: shortest paths, network flows, maximal clique, optimal coloring etc. Page description: Graph Magics - an ultimate software for graph theory, having many very useful things, among which a strong graph generator and more than 15 different algorithms that one may apply to graphs (ex. Shortest Path, Network Flows, Minimum Cut, Maximum Clique, Chinese Postman Problem, Graph Center, Graph Median etc.)
	Combinatorics Software of the Algorithms Project URL: http://algo.inria.fr/libraries/software.html ODP description: 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. Page title: Algolib: The Algorithms Project's Library and Other Packages of the Algorithms Project Page description: (none)