Assume that there is a graph with no special feature. This graph is partitioned into two sub graphs by removing some nodes and the edges connected to those nodes.
My aim is to find minimum number of these nodes which separates the graph into two components. However, I do not try to determine what these nodes are. I aims to find only its quantity.
How can I accomplish this ?