论文标题
顶点覆盖问题的邻里评估标准
Neighbourhood Evaluation Criteria for Vertex Cover Problem
论文作者
论文摘要
邻里评估标准是一种启发式近似算法，该算法试图解决最小顶点覆盖。对每个顶点进行检查，并保留了最高的基于计数的顶点。在多个同等顶点的情况下，选择了最低邻居影响的顶点。在仍然存在的多个等效顶点的情况下，剩余的有效顶点计数（最高独立集启用计数）的一个顶点被选择为打界器。
Neighbourhood Evaluation Criteria is a heuristical approximate algorithm that attempts to solve the Minimum Vertex Cover. degree count is kept in check for each vertex and the highest count based vertex is included in our cover set. In the case of multiple equivalent vertices, the one with the lowest neighbourhood influence is selected. In the case of still existing multiple equivalent vertices, the one with the lowest remaining active vertex count (the highest Independent Set enabling count) is selected as a tie-breaker.
