Faster Graph Coloring in Polynomial Space

We present a polynomial-space algorithm that computes the number independent sets of any input graph in time $O(1.1387^n)$ for graphs with maximum degree 3 and in time $O(1.2355^n)$ for general graphs, where n is the number of vertices. Together with the inclusion-exclusion approach of Bj\"orklund, Husfeldt, and Koivisto [SIAM J. Comput. 2009], this leads to a faster polynomial-space algorithm for the graph coloring problem with running time $O(2.2355^n)$. As a byproduct, we also obtain an exponential-space $O(1.2330^n)$ time algorithm for counting independent sets. Our main algorithm counts independent sets in graphs with maximum degree 3 and no vertex with three neighbors of degree 3. This polynomial-space algorithm is analyzed using the recently introduced Separate, Measure and Conquer approach [Gaspers & Sorkin, ICALP 2015]. Using Wahlstr\"om's compound measure approach, this improvement in running time for small degree graphs is then bootstrapped to larger degrees, giving the improvement for general graphs. Combining both approaches leads to some inflexibility in choosing vertices to branch on for the small-degree cases, which we counter by structural graph properties