Disconnecting two vertices s and z in a graph by removing minimum number of is fundamental problem algorithmic theory. This (s, z)-Separation well-known to be polynomial solvable serves as an important primitive many applications related network connectivity.
