1 paper · 2 filters
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…