最大圈分解问题的研究进展  

Survey of Cycle Packing Problem

作　　者：罗卫东[1] 王建新[1] 冯启龙[1] LUO Wei-dong WANG Jian-xin FENG Qi-long(School of Information Science and Engineering, Central South University, Changsha 410083, China)

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《计算机科学》2017年第1期1-6,31,共7页Computer Science

基　　金：国家自然科学基金(61402054;61502054;61370172)资助

摘　　要：最大圈分解问题最早由Erds和Pósa提出,随后研究人员在图论领域和理论计算机科学领域中对其进行了广泛的探索。最近研究发现,该问题在计算生物学上特别是在构建进化树与分析基因组的研究方面有重要的应用。主要介绍了该问题的研究现状。首先讨论了该问题在图论方面的研究进展;随后对该问题的近似算法、参数算法、参数复杂性与不可近似性进行了分析和讨论;最后给出了该问题的进一步研究方向。Cycle packing problem was first presented by Erdos and Posa. Since then researchers have been studying the problem in graph theory and theoretical computer science. Recently, researchers find that the problem has improtant ap- plications in computational biology, especially for reconstruction of evolutionary trees and genomic analysis. In this pa- per, an introduction to the research status of this problem was given. First and foremost, some results of cycle packing problem in graph theory were discussed. Then, we analyzed and discussed approximation algorithms, parameterized al- gorithms, parameterized complexity and inapproximability of the problem. At last, some further research directions on this problem were given.

关 键 词：最大圈分解 图论 近似算法 参数算法 不可近似性 参数复杂性 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]