no code implementations • 28 Nov 2013 • Aylin Mousavian, Alireza Rezvanian, Mohammad Reza Meybodi
Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph.
