Improved Running Time Analysis of Exact Algorithms for Graph Coloring Problems

The authors present a new general method called "piecewise analysis" to analyze the running time of branching algorithms. They apply this method to improve the running time analysis of two 17-year-old algorithms that solve the 4-Coloring and #3-Coloring problems.