GRALS: GCN-Guided Redundancy-Aware Local Search for Minimum Vertex Cover

Chanjuan Liu, Qiqi Bao, Yu Zhang +1

The minimum vertex cover (MVC) problem seeks to identify the smallest set of vertices that cover all edges in an undirected graph. As a fundamental NP-hard combinatorial optimizati…