%0 Journal Article
%T Minimum Vertex Cover Algorithm for Solving the Planar Graph<br>一种求解平面图的最小顶点覆盖算法
%A WU Chun
%A ZHU Guo-Hun
%A XIE Yu-Zhong
%A LIN Hong
%A <br>吴春
%A 朱国魂
%A 谢玉忠
%A 林宏
%J 计算机系统应用
%D 2010
%I 
%X 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.
%K vertex cover
%K minimum vertex cover
%K maximum independent set
%K planar graph
%K epsilon neighborhood<br>点覆盖
%K 最小顶点覆盖
%K 最大独立集
%K 平面图
%K 邻域
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=26015EBBBE34C18891C3518097CACE89&yid=140ECF96957D60B2&vid=2A8D03AD8076A2E3&iid=9CF7A0430CBB2DFD&sid=C3BF5C58156BEDF0&eid=8C83C265AD318E34&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=9