Graph Coloring

PSU CS 410 CS Final Project
Due Wednesday March 21, 5:00PM

In this project, you will apply the methods (and perhaps the code) you have developed to a new problem: graph coloring.

Instances will be presented in the DIMACS format, and output will be in that format as well. Check out this sample instance to get an idea of the format. Another sample instance is available to check your implementation: it is optimally colorable using 28 colors. A good location for more information on graph coloring is Joseph Culberson's Graph Coloring Resources Page.

Your program should accept a DIMACS-format graph coloring instance on standard input, and produce a DIMACS-format output on standard output. It should do something sensible when given no arguments, although optional ``tuning'' arguments are allowed if their use is documented. Remember to follow the safety guidelines when running experiments.

In default mode, your program must perform complete search yielding an optimal solution for up to 10-node instances. Beyond 10 nodes, or in a non-default configuration, you may use incomplete methods if desired.

Grading will be based on general demonstration of mastery of course material, particularly

There will also be a contest, with a small prize; this will in no way affect your grade. Programs will be judged subjectively on

Please submit the following:
  1. Source code, ready to compile on departmental UNIX machines.
  2. Documentation of program invocation and options, if any.
  3. 2-4 pages of writeup:
    1. Algorithm and approach used
    2. Heuristics tried
    3. Program structure
    4. Performance evaluation
    5. Potential improvements

Projects should be submitted by e-mail to <bart@cs.pdx.edu>. The words "CS410CS Final Project" should appear somewhere in the subject line. No MS Office documents please: if you use MS Office, ``Print To File'' to create PostScript and submit that instead.

Remember: