Complexity of the maximum leaf spanning tree problem on planar and regular graphs-Reference-Cited by-同舟云学术

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

Complexity of the maximum leaf spanning tree problem on planar and regular graphs

Published:2016-05 Issue: Volume:626 Page:134-143
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Reich Alexander

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Hardness of approximating problems on cubic graphs;Alimonti,1998

2. Max-leaves spanning tree is APX-hard for cubic graphs;Bonsma;J. Discrete Algorithms,2012

3. A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs;Bonsma,2008

4. The regenerator location problem;Chen;Networks,2010

5. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs;Correa,2008

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

1. The complexity of spanning tree problems involving graphical indices;Discrete Applied Mathematics;2024-04

2. A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks;Theoretical Computer Science;2022-06

3. Scale-Free Spanning Trees and Their Application in Genomic Epidemiology;Journal of Computational Biology;2021-10-01

4. Connected domination in maximal outerplanar graphs;Discrete Applied Mathematics;2020-09

5. Connected Domination;Topics in Domination in Graphs;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP