{"title":"A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem","authors":"A. G. Klyuchikov, M. Vyalyi","doi":"10.33048/daio.2021.28.710","DOIUrl":null,"url":null,"abstract":"— We describe a Win/Win algorithm that produces in time polynomial in the size of a graph G and a given parameter k either a spanning tree with at least k + 1 leaves or a path decomposition of width at most k . This algorithm is optimal due to the path decomposition theorem.","PeriodicalId":126663,"journal":{"name":"Diskretnyi analiz i issledovanie operatsii","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Diskretnyi analiz i issledovanie operatsii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/daio.2021.28.710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
— We describe a Win/Win algorithm that produces in time polynomial in the size of a graph G and a given parameter k either a spanning tree with at least k + 1 leaves or a path decomposition of width at most k . This algorithm is optimal due to the path decomposition theorem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
