Science Central - All about Science

Wednesday, 7 January, 2009
Home  |  Submit Science Site  |  Add to Favorite  |  Contact

search
for
Directories
 
Category:  Science » Math » Combinatorics » Graph Theory UPDATE URL | REPORT BROKEN LINK

Benchmarks with Hidden Optimum Solutions for Graph Problems

 Popularity:    Hit: 112 | Visit: 2
Details
Datasets in DIMACS graph format for Independent Set, Vertex Cover, Clique and Vertex Coloring problems.

Sponsored Links:


URL:
Title: Challenging Benchmarks for Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex Coloring - Generating Hard Graph Problem Instances
Description:

Category:


Related sites
Regular Graphs Page (Popularity: ): Tables of simple connected k-regular graphs on n vertices and girth at least g.
The Four Color Theorem (Popularity: ): Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul ...
Sandpiles in Graphs (Popularity: ): An application of cellular automata by Angela R. Kerns.
Network Resources for Colouring a Graph (Popularity: ): Resources for formulating and solving coloring problems.
Signed, Gain and Biased Graphs (Popularity: ): List of publications and manuscripts annotated by Thomas Zaslavsky.
Multicommodity Problems (Popularity: ): Instances and random generators of multicommodity flow and network design problems.
Graphnet Archives (Popularity: ): Archives of the Graphnet mailing list from February 1990.
Other Graph Theory and Related Pages (Popularity: ): Miscellaneous pages collected by Stephen C. Locke.
Four Colour Theorem (Popularity: ): A new proof of the four color theorem by Ashay Dharwadker that uses group theory ...
The Hamiltonian Page (Popularity: ): Hamiltonian cycle and path problems, their generalisations and variations.

© 2005-2008 Science Central. All Rights Reserved

Home | Submit Science Site | Add to Favorite | Privacy | Contact