Yet Another Graph Partitioning Problem is NP-Hard

Ryan H. Lewis

Recently a large number of graph separator problems have been proven to be \textsc{NP-Hard}. Amazingly we have found that $\alpha$-Subgraph-Balanced-Vertex-Separator, an important varia…