Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree-Reference-Cited by-同舟云学术

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

Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree

Published: Issue: Volume: Page:222-233
ISSN:0302-9743
Container-title:Algorithms - ESA 2008
language:
Short-container-title:

Author:

Bonsma Paul,Dorn Frederic

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-87744-8_19.pdf

Reference15 articles.

1. Lecture Notes in Computer Science;N. Alon,2007

2. Lecture Notes in Computer Science;N. Alon,2007

3. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet. 11, 1–21 (1993)

4. Lecture Notes in Computer Science;P. Bonsma,2003

5. Bonsma, P., Dorn, F.: An FPT algorithm for directed spanning k-leaf (2007), http://arxiv.org/abs/0711.4052

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

1. Kernel(s) for problems with no kernel;ACM Transactions on Algorithms;2012-09

2. Max-leaves spanning tree is APX-hard for cubic graphs;Journal of Discrete Algorithms;2012-04

3. A New Algorithm for Finding Trees with Many Leaves;Algorithmica;2010-09-28

4. FPT algorithms and kernels for the Directed k-Leaf problem;Journal of Computer and System Sciences;2010-03

5. On complexity of Minimum Leaf Out-Branching problem;Discrete Applied Mathematics;2009-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP