Graph Coloring Analysis Project
Budget: $30 – $250 USD
This project looks at implementing an algorithm in multiple ways to solve a problem, analyzing the algorithms’ implementations, along with testing and characterizing your implementations to show they match your analysis.
The particular problem for the project is graph coloring.
For the first part of the project, different conflict graphs which can represent real world problems will be created and saved in files.
For the second part of the problem, Various coloring orders will be implemented and analyzed for runtime efficiency and coloring efficiency.
These efficiencies are intimately related to the data structures used for both the input graph data and the intermediate data necessary for the ordering and coloring algorithms.
The particular problem for the project is graph coloring.
For the first part of the project, different conflict graphs which can represent real world problems will be created and saved in files.
For the second part of the problem, Various coloring orders will be implemented and analyzed for runtime efficiency and coloring efficiency.
These efficiencies are intimately related to the data structures used for both the input graph data and the intermediate data necessary for the ordering and coloring algorithms.