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 Bjorklund, 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 Wahlstrom'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.

[1]  Magnus Wahlström,et al.  Exact algorithms for finding minimum transversals in rank-3 hypergraphs , 2004, J. Algorithms.

[2]  Mikko Koivisto,et al.  An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[3]  Catherine S. Greenhill.  The complexity of counting colourings and independent sets in sparse graphs and hypergraphs , 2000, computational complexity.

[4]  Konstanty Junosza-Szaniawski,et al.  Counting independent sets via Divide Measure and Conquer method , 2015, ArXiv.

[5]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[6]  Andreas Björklund,et al.  Inclusion--Exclusion Algorithms for Counting Set Partitions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[7]  Fedor V. Fomin,et al.  On Two Techniques of Combining Branching and Treewidth , 2009, Algorithmica.

[8]  Fabrizio Grandoni,et al.  A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.

[9]  H. Bodlaender,et al.  An exact algorithm for graph coloring with polynomial memory , 2006 .

[10]  Ola Angelsmark,et al.  Partitioning Based Algorithms for Some Colouring Problems , 2005, CSCLP.

[11]  Rajeev Motwani,et al.  Worst-case time bounds for coloring and satisfiability problems , 2002, J. Algorithms.

[12]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[13]  Andreas Björklund,et al.  Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings , 2007, Algorithmica.

[14]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[15]  David Eppstein.  Small Maximal Independent Sets and Faster Exact Graph Coloring , 2001, WADS.

[16]  Magnus Wahlström,et al.  Counting models for 2SAT and 3SAT formulae , 2005, Theor. Comput. Sci..

[17]  Fedor V. Fomin,et al.  Branching and Treewidth Based Exact Algorithms , 2006, ISAAC.

[18]  Alex D. Scott,et al.  Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function , 2006, TALG.

[19]  Jesper Makholm Byskov.  Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..

[20]  Gerhard J. Woeginger,et al.  Open problems around exact algorithms , 2008, Discret. Appl. Math..

[21]  Chung C. Wang,et al.  An Algorithm for the Chromatic Number of a Graph , 1974, JACM.

[22]  Serge Gaspers,et al.  Exponential Time Algorithms - Structures, Measures, and Bounds , 2010 .

[23]  Andreas Björklund,et al.  Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..

[24]  Magnus Wahlström,et al.  A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances , 2008, IWPEC.

[25]  Yoichi Iwata,et al.  A Faster Algorithm for Dominating Set Analyzed by the Potential Method , 2011, IPEC.

[26]  Fedor V. Fomin,et al.  Reports in Informatics , 2005 .

[27]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[28]  Serge Gaspers,et al.  A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between , 2009, J. Comput. Syst. Sci..

[29]  Martin Fürer,et al.  Algorithms for Counting 2-SAT Solutions and Colorings with Applications , 2005, Electron. Colloquium Comput. Complex..

[30]  Serge Gaspers,et al.  Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets , 2015, ICALP.

[31]  Burkhard Monien,et al.  Upper bounds on the bisection width of 3- and 4-regular graphs , 2006, J. Discrete Algorithms.