Are there any common approaches for finding a vertex separator in a bipartite graph $G = (V_1, V_2, E)$ where the selected vertices are constrained to come from one partition of the graph?I have a large bipartite graph with $|V_1|$ = 40M and $|V_2|$ = 150K and want to remove vertices from $V_1$ to disconnect the graph.  Obviously, with a graph this large, I need a fairly efficient algorithm.Does anyone have suggestions?
Bipartite vertex separator
ds.algorithms;graph theory;co.combinatorics;approximation algorithms