Backdoor Treewidth for SAT

Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan

doi:10.1007/978-3-319-66263-3_2

by Robert Ganian, M. S. Ramanujan, Stefan Szeider

Reference:

Backdoor Treewidth for SATRobert Ganian, M. S. Ramanujan, Stefan SzeiderTheory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{GanianRamanujanSzeider17b,
  author    = {Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title     = {Backdoor Treewidth for {SAT}},
   booktitle = {Theory and Applications of Satisfiability Testing -
                  {SAT} 2017 - 20th International Conference,
                  Melbourne, VIC, Australia, August 28 - September 1,
                  2017, Proceedings},
  pages     = {20--37},
   editor    = {Serge Gaspers and
               Toby Walsh},
  series    = LNCS,
  volume    = {10491},
  publisher = Springer,
  year      = {2017},
  doi       = {10.1007/978-3-319-66263-3_2},
  url       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-014.pdf},
  keywords={xtract},
}