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.

中文翻译：

---

顶点覆盖问题的邻域评估标准

Neighborhood Evaluation Criteria 是一种启发式近似算法，试图求解最小顶点覆盖。检查每个顶点的度数计数，并且基于最高计数的顶点包含在我们的覆盖集中。在多个等效顶点的情况下，选择具有最低邻域影响的顶点。在仍然存在多个等效顶点的情况下，选择剩余活动顶点数最少（独立集启用数最高）的那个作为决胜局。