边连通路径的参数化复杂度

{"title":"边连通路径的参数化复杂度","authors":"Neeldhara Misra, Fahad Panolan, Saket Saurabh","doi":"10.1007/978-3-030-19955-5_25","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Parameterized Complexity of Edge-Linked Paths\",\"authors\":\"Neeldhara Misra, Fahad Panolan, Saket Saurabh\",\"doi\":\"10.1007/978-3-030-19955-5_25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":319321,\"journal\":{\"name\":\"Computer Science Symposium in Russia\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Symposium in Russia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-19955-5_25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Symposium in Russia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-19955-5_25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}