Graph Coloring Empirical Performance Model

Rating: No reviews yet
Downloads: 0
Updated: Jul 22, 2014 by lucasdeandrade87
Dev status: Planning Help Icon

Available Downloads

There are no downloads associated with this release.

Release Notes

This release consists on the features that allow the system to build an Empirical Performance Model for the Graph Coloring Problem (GCP).

Given a GCP instance, the system will be able to:
  • Extract features
  • Run Graph Coloring algorithms to measure performance
  • Compare performance of Graph Coloring algorithms to generate a ranking
  • Build an ARFF file containing the instance name, features and classes being the ranking of algorithms that performed best for each instance.