I have an unweighted and undirected graph, and I want to divide this graph into two connected components by removing some vertices. The main objective is to minimize the number of vertices which must be deleted in order to partition the graph into two sub graphs.
How can I accomplish this ?
The first thing coming to my mind is
Ford Fulkersonalgorithm, but I think it is not appropriate for this problem.