A SAT Approach to Clique-Width

Clique-width is a graph invariant that has been widely studied in combinatorics and computational logic. Computing the clique-width of a graph is an intricate problem, because the exact clique-width is not known even for very small graphs. We present a new method for computing clique-width via an encoding to propositional satisfiability (SAT), which is then evaluated by a SAT solver. Our encoding is based on a reformulation of clique-width in terms of partitions that utilizes an efficient encoding of cardinality constraints. Our SAT-based method is the first to discover the exact clique-width of various small graphs, including famous named graphs from the literature as well as random graphs of various density. With our method, we determined the smallest graphs that require a small predescribed clique-width. We further show how our method can be modified to compute the linear clique-width of graphs, a variant of clique-width that has recently received considerable attention. In an appendix, we provide certificates for tight upper bounds for the clique-width and linear clique-width of famous named graphs.

[1]  Sharad Malik,et al.  Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.

[2]  Dieter Rautenbach,et al.  The relative clique-width of a graph , 2007, J. Comb. Theory, Ser. B.

[3]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

[4]  Arie M. C. A. Koster,et al.  Treewidth: Computational Experiments , 2001, Electron. Notes Discret. Math..

[5]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[6]  Egon Wanke,et al.  k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..

[7]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.

[8]  Udi Rotics,et al.  On the Clique-Width of Perfect Graph Classes , 1999, WG.

[9]  Igor L. Markov,et al.  Conflict Anticipation in the Search for Graph Automorphisms , 2012, LPAR.

[10]  Jan Arne Telle,et al.  Finding Good Decompositions for Dynamic Programming on Dense Graphs , 2011, IPEC.

[11]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[12]  Magnus Wahlström,et al.  New Plain-Exponential Time Classes for Graph Homomorphism , 2009, Theory of Computing Systems.

[13]  Armin Biere.  LINGELING and Friends Entering the SAT Challenge 2012 , 2012 .

[14]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[15]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[16]  Hantao Zhang,et al.  Combinatorial Designs by SAT Solvers , 2021, Handbook of Satisfiability.

[17]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[18]  Udi Rotics,et al.  Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width , 2011, CSR.

[19]  Mutsunori Banbara,et al.  Compiling finite linear CSP into SAT , 2006, Constraints.

[20]  Bruno Courcelle,et al.  Infinite Transducers on Terms Denoting Graphs , 2013, ELS.

[21]  Jonathan Cole Smith,et al.  A combinatorial optimization algorithm for solving the branchwidth problem , 2012, Comput. Optim. Appl..

[22]  Jan Arne Telle,et al.  Boolean-width of graphs , 2009, Theor. Comput. Sci..

[23]  Mamadou Moustapha Kanté,et al.  Linear Rank-Width and Linear Clique-Width of Trees , 2013, WG.

[24]  Michel Habib,et al.  A survey of the algorithmic aspects of modular decomposition , 2009, Comput. Sci. Rev..

[25]  Bruno Courcelle,et al.  Context-free Handle-rewriting Hypergraph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[26]  Sang-il Oum,et al.  Rank‐width of random graphs , 2010, J. Graph Theory.

[27]  Richard E. Korf,et al.  Best-First Search for Treewidth , 2007, AAAI.

[28]  Pinar Heggernes,et al.  Graphs of linear clique-width at most 3 , 2011, Theor. Comput. Sci..

[29]  Joao Marques-Silva,et al.  Empirical Study of the Anatomy of Modern Sat Solvers , 2011, SAT.

[30]  Udi Rotics,et al.  Polynomial-time recognition of clique-width ≤3 graphs , 2012, Discret. Appl. Math..

[31]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[32]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[33]  Frank Harary,et al.  Graph Theory , 2016 .

[34]  Joao Marques-Silva,et al.  Anatomy and Empirical Evaluation of Modern SAT Solvers , 2011, Bull. EATCS.

[35]  Bruno Courcelle,et al.  Constrained-Path Labellings on Graphs of Bounded Clique-Width , 2010, Theory of Computing Systems.

[36]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[37]  Pinar Heggernes,et al.  Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs , 2012, Discret. Appl. Math..

[38]  Egon Wanke,et al.  On the relationship between NLC-width and linear NLC-width , 2005, Theor. Comput. Sci..

[39]  B. Reed,et al.  Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .

[40]  Helmut Veith,et al.  Encoding Treewidth into SAT , 2009, SAT.

[41]  Vibhav Gogate,et al.  A Complete Anytime Algorithm for Treewidth , 2004, UAI.

[42]  J. Christopher Beck.  Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.

[43]  Udi Rotics,et al.  Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..

[44]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[45]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[46]  Udi Rotics,et al.  On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..

[47]  Udi Rotics,et al.  On the Relationship between Clique-Width and Treewidth , 2001, WG.

[48]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[49]  Martin Beyß,et al.  Fast Algorithm for Rank-Width , 2012, MEMICS.

[50]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[51]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..