|
|
 |
Open Directory from the Jesus Army
The largest human-edited directory on the web
|
Open Directory: Science: Math: Combinatorics: Graph Theory
|
 | The Four Color Theorem www.math.gatech.edu/~thomas/FC/fourcolor.html Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas. |
|
 | Graphnet Archives listserv.nodak.edu/archives/graphnet.html Archives of the Graphnet mailing list from February 1990. |
|
 | Harmonious Colourings www.maths.dundee.ac.uk/~kedwards/harmcol.html Notes and bibliography by Keith Edwards. |
|
 | Matrix Graph Grammars www.mat2gra.info Algebraic approach to graph dynamics and graph grammars, using logics, functional analysis and tensor algebra. |
|
 | MERLIN www.merlins-world.de An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints. |
|
 | Multicommodity Problems www.di.unipi.it/di/groups/optimize/Data/MMCF.html Instances and random generators of multicommodity flow and network design problems. |
|
 | Regular Graphs Page www.mathe2.uni-bayreuth.de/markus/reggraphs.html Tables of simple connected k-regular graphs on n vertices and girth at least g. |
|
 | Sandpiles in Graphs www.cs.wvu.edu/~angela/cs418a/cs418a.html An application of cellular automata by Angela R. Kerns. |
|
 | Spectral Graph Theory www.sgt.pep.ufrj.br People, publications, research topics, open problems, events and resources. |
|
 | The Travelling Salesman Problem www.hermetic.ch/misc/ts3/ts3demo.htm Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases. |
|
 | TSP Generator www.60feet6.com/research/usa_tsp_tech.html Generates a Traveling Salesman Problem map and data for a given set of US cities. |
|
|
The Jesus Army is not responsible for the content of the Open Directory, which we provide here as a public service. Please contact the Open Directory Project with any questions or comments you may have, or follow the links above.
|
|
|