title: Find a cut in graph that divides the graph to approximately equal two subgraphs
body: <p>Is there a practical algorithm (not NP-hard) that can cut a graph into two <em>approximately</em> equal sub-graphs (e.g., One sub-graph has 40%-50% vertices), in the meantime, prove that the cut is the minimal possible cut given the condition that two sub-graphs have approximately equal number of vertices?</p>