GRALS: GCN-Guided Redundancy-Aware Local Search for Minimum Vertex Cover
arXiv:2503.06396v2 Announce Type: replace Abstract: 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