Re: An algorithm with Minimum vertex cover without considering its performance

wtxwtx@xxxxxxxxx wrote:
Hi,
I know that searching for a minimum vertex cover is a NP-Complete in
computing complexity.

I am interested not in its performance, but in an algorithm that can
get a right solution in theory as a mind exercise.
....

If you really don't care about performance, why not go brute force?

Iterate over the subsets of V, testing each one for being a vertex
cover, and return the smallest subset that passes.

Patricia
.