With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
Some results have been hidden because they may be inaccessible to you
Show inaccessible results