BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Benchmark graphs for testing several NP-hard graph algorithms: maximum clique, maximum independent set, minimum vertex cover and vertex coloring. All instances are expressed in DIMACS format and are planted with hidden optimum solutions.|
|Math Topics:||Graph Theory, Computer Science|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.