Complexity of the Maximum k-Path Vertex Cover Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Complexity of the Maximum k-Path Vertex Cover Problem

Published:2018 Issue: Volume: Page:240-251
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Miyano Eiji,Saitoh Toshiki,Uehara Ryuhei,Yagita Tsuyoshi,van der Zanden Tom C.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-75172-6_21

Reference19 articles.

1. Apollonio, N., Simeone, B.: The maximum vertex coverage problem on bipartite graphs. Dis. Appl. Math. 165, 37–48 (2014)

2. Betzler, N., Niedermeier, R., Uhlmann, J.: Tree decompositions of graphs: saving memory in dynamic programming. Dis. Optim. 3, 220–229 (2006)

3. Hans, L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

4. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $${O}(c^k n)$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)

5. Brešar, B., Kardoš, F., Katrenič, J., Semanišin, G.: Minimum k-path vertex cover. Dis. Appl. Math. 159(12), 1189–1195 (2011)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reconfiguring <i>k</i>-Path Vertex Covers;IEICE Transactions on Information and Systems;2022-07-01

2. Reconfiguring k-path Vertex Covers;WALCOM: Algorithms and Computation;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3