📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

First Author: Ordyniak S

Attributed to: Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-21581-0_6

Publication URI: http://dx.doi.org/10.1007/978-3-642-21581-0_6

Type: Book Chapter

Book Title: Theory and Applications of Satisfiability Testing - SAT 2011 (2011)

Page Reference: 47-60