I have simple undirected graph. I want to determine a size of
minimum vertex cover, a size of
maximal independent set and a size of a
global minimum cut.
A minimum vertex cover is complementary to a maximum independent set. So, I can find one of this this and get both of them.
Is there any relation with global minimum cut? Or I have to find this size independent from other?