Projects for the university course Advanced Algorithms
Find the chromatic number ofa given undirected graph, using both an exhaustive search approach and a greedy heuristic.
Count the occurrence of each letter in books, using three strategies: exact counting, approximate counting with fixed probability, and approximate counting with decreasing probability.
Find the most common words in books using the Count-Min Sketch, ehich is a probabilistic data structure.