https://www.mdpi.com/1424-8220/23/18/7831
TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs
The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem aiming to find the smallest set of vertices such that every...
local search algorithmminimum vertex cover