一种求解平面图的最小顶点覆盖算法  

Minimum Vertex Cover Algorithm for Solving the Planar Graph

作　　者：吴春[1] 朱国魂[1] 谢玉忠[1] 林宏[1] 

机构地区：[1]桂林电子科技大学计算机与控制学院,广西桂林541004

出　　处：《计算机系统应用》2010年第9期97-100,共4页Computer Systems & Applications

基　　金：广西区教育厅立项项目(200911LX114)

摘　　要：最小顶点覆盖问题是图论中经典的组合优化问题,在实际生活中有着广泛的应用价值。根据最小顶点覆盖与最大独立集在图论中事实上是属于等价问题这一特性,从最大独立集的角度出发,根据最大独立集的特性,设计了一种求解简单平面图的最大独立集算法,从而求出最小顶点覆盖。通过实验结果的比对验证算法的正确性和有效性。The minimum vertex cover problem is a classical problem in combinatorial optimization and has a wide range of values in real life.The problem of the minimum vertex cover and the maximum independent set is actually the equivalence problem in the graph theory.In this paper, the maximum independent set angle and design a maximum independent set algorithm for solving the planar graph is formed, according to characteristics of the maximum independent set, and then the minimum vertex cover is obtained.After many experiments, the results show adequately that the algorithm presented in the thesis is correct and effective.

关 键 词：点覆盖 最小顶点覆盖 最大独立集 平面图 邻域 

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