This site aims to support in the continued research into Graph-Vertex Coloring Algorithms
To see an example output from an execution of an Instance Space Analysis you can follow this link: Example To see the best known results: best
All Algorithms have currently been run for a maximum of 10 minutes. Therefore for a fair comparison with new algorithms they are expected to have had a similar limit on their allowed running time. For the homer.col instance there is a current issue and as such this instance should be skipped.
To allow for analysis using user algorithms, the page allows for users to add algorithms to the test suite that can be used. This process is done by,
This triggers a simple coloring-verifier that ensure that only valid solutions are present on the repository, in the case that an algorithm shows a better performance than previously denoted in the best_solutions.md file, said file is updated to reflect this.
To perform an Instance Space Analysis (ISA),
Modify the config.yaml file found in the main repository, adjusting the list of algorithms to match the algorithms that one wants to use (The names should match the directory names that contain solution files generated by said algorithm). Ensure that the dir parameter does not overlap with an already existing docs subdirectory, and that the parameters are as desired in regards to the ISA.
Push these changes onto the GitHub repository.
Go to the page corresponding to the performed ISA /dir/page.html replacing dir with the user defined name in the config.yaml
Inspect and analyze the plots using the two for easier comparisons.
To add more instance to the analysis,