使用SAT求解器计算最大不可避免子图

{"title":"使用SAT求解器计算最大不可避免子图","authors":"C. K. Cuong, Marijn J. H. Heule","doi":"10.1007/978-3-319-40970-2_13","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"433 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Computing Maximum Unavoidable Subgraphs Using SAT Solvers\",\"authors\":\"C. K. Cuong, Marijn J. H. Heule\",\"doi\":\"10.1007/978-3-319-40970-2_13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":446175,\"journal\":{\"name\":\"International Conference on Theory and Applications of Satisfiability Testing\",\"volume\":\"433 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Theory and Applications of Satisfiability Testing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-40970-2_13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Theory and Applications of Satisfiability Testing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-40970-2_13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}