A SAT Approach to Clique-Width
DOI10.1145/2736696zbMath1354.68240arXiv1304.5498MaRDI QIDQ2946763
Stefan Szeider, Marijn J. H. Heule
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic, Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.5498
satisfiability; clique-width; SAT encoding; SAT solver; cardinality constraint; linear clique-width; \(k\)-expression
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Uses Software
