{"title":"Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths","authors":"D. Lokshtanov, Saket Saurabh, M. Zehavi","doi":"10.1007/978-3-030-42071-0_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Treewidth, Kernels, and Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-42071-0_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
