This project contains interesting solutions to various NP-hard problems. Algorithms are implemented in C language, it's always good to know the basics.
Usage of greedy coloring and sorting of branches greatly reduces algorithm's time of completion.
Modular product of two graphs shows interesting properties and connection between this problem and finding maximum clique.