Package es.urjc.etsii.grafo.graphs.mvc
package es.urjc.etsii.grafo.graphs.mvc
-
ClassesClassDescriptionProbabilistic constructive method for the Minimum Vertex Cover (MVC) problem, used as the "Construct" step of the CMSA demo in this project.Exact solver for the CMSA "Solve" step of the Minimum Vertex Cover demo: given a restricted set of candidate vertices, finds the smallest subset of those candidates that covers every edge of the original instance.