Computing Maximum Unavoidable Subgraphs Using SAT Solvers

C. K. Cuong, M. J. H. Heule. Computing Maximum Unavoidable Subgraphs Using SAT Solvers. In Nadia Creignou, Daniel Le Berre, editors, Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. Volume 9710 of Lecture Notes in Computer Science, pages 196-211, Springer, 2016. [doi]

Abstract

Abstract is missing.