关于缩边法消除小诱导子图的硬度

{"title":"关于缩边法消除小诱导子图的硬度","authors":"D. Lokshtanov, Neeldhara Misra, Saket Saurabh","doi":"10.1007/978-3-319-03898-8_21","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges\",\"authors\":\"D. Lokshtanov, Neeldhara Misra, Saket Saurabh\",\"doi\":\"10.1007/978-3-319-03898-8_21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":137775,\"journal\":{\"name\":\"International Symposium on Parameterized and Exact Computation\",\"volume\":\"2008 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Parameterized and Exact Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-03898-8_21\",\"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 Symposium on Parameterized and Exact Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-03898-8_21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}