Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm
Author:Ke Xu
Description: 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.
Levels: Research
Languages: English
Resource Types: Software
Math Topics: Graph Theory, Computer Science

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.