Algorithms for maximum internal spanning tree problem for some graph classes-Reference-Cited by-同舟云学术

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

Algorithms for maximum internal spanning tree problem for some graph classes

Published:2022-09-05 Issue:5 Volume:44 Page:3419-3445
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Sharma Gopika,Pandey Arti,Wigal Michael C.

Funder

GRFP

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-022-00897-4.pdf

Reference28 articles.

1. Binkele-Raible D, Fernau H, Gaspers S et al (2013) Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1):95–128

2. Chen ZZ, Harada Y, Guo F et al (2018) An approximation algorithm for maximum internal spanning tree. J Comb Optim 35(3):955–979

3. Cohen N, Fomin FV, Gutin G et al (2010) Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J Comput Syst Sci 76(7):650–662

4. Fomin FV, Gaspers S, Saurabh S et al (2013) A linear vertex kernel for maximum internal spanning tree. J Comput Syst Sci 79(1):1–6

5. Garey MR, Johnson DS (1979) Computers and intractability, vol 174. freeman San Francisco

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP