A SAT Approach to Clique-Width
Work
Year: 2015
Type: article
Abstract: 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 i... more
Authors Marijn J. H. Heule, Stefan Szeider
Institutions The University of Texas at Austin, TU Wien
Cites: 47
Cited by: 25
Related to: 10
FWCI: 2.322
Citation percentile (by year/subfield): 95.19
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Grant IDS CNS-0910913, 239962, N66001-10-2-4087