一些边图问题的扩展:标准复杂度和参数化复杂度

{"title":"一些边图问题的扩展:标准复杂度和参数化复杂度","authors":"Katrin Casel, H. Fernau, M. K. Ghadikolaei, J. Monnot, F. Sikora","doi":"10.1007/978-3-030-25027-0_13","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"262 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Extension of Some Edge Graph Problems: Standard and Parameterized Complexity\",\"authors\":\"Katrin Casel, H. Fernau, M. K. Ghadikolaei, J. Monnot, F. Sikora\",\"doi\":\"10.1007/978-3-030-25027-0_13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":335412,\"journal\":{\"name\":\"International Symposium on Fundamentals of Computation Theory\",\"volume\":\"262 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Fundamentals of Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-25027-0_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 Symposium on Fundamentals of Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-25027-0_13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}