Drexel dragonThe Math Forum

The Math Forum Internet Mathematics Library

BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems

Library Home || Full Table of Contents || 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- The Math Forum at NCTM. All rights reserved.