Algorithm Design Complexity

Research Frontiers in Approximation Algorithms for Vertex Coloring

Study of approximation algorithms and hardness results for graph coloring problems and their generalizations.

All Algorithm Design & Complexity PhD categories