$(k+1)$-LST/$k$-路径宽度问题的双赢算法

Diskretnyi analiz i issledovanie operatsii Pub Date : 2021-11-01 DOI:10.33048/daio.2021.28.710

A. G. Klyuchikov, M. Vyalyi

{"title":"$(k+1)$-LST/$k$-路径宽度问题的双赢算法","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":"{\"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}","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

摘要

-我们描述了一种双赢算法，该算法在给定参数k和图G大小的时间多项式上产生至少有k + 1个叶子的生成树或宽度最多为k的路径分解。由于路径分解定理，该算法是最优的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem

— 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Diskretnyi analiz i issledovanie operatsii

自引率

0.00%

发文量