<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Graph / Travelling salesman problem / Vertex / Cycle / Hamiltonian path / Graph automorphism / Vertex cover
Date: 2013-06-19 04:16:58
Graph theory
Mathematics
Computational complexity theory
NP-complete problems
Graph
Travelling salesman problem
Vertex
Cycle
Hamiltonian path
Graph automorphism
Vertex cover

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Download Document from Source Website

File Size: 45,42 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document