Yet Another Graph Partitioning Problem is NP-Hard
Computational Complexity
2014-03-24 v1 Data Structures and Algorithms
Abstract
Recently a large number of graph separator problems have been proven to be \textsc{NP-Hard}. Amazingly we have found that -Subgraph-Balanced-Vertex-Separator, an important variant, has been overlooked. In this work ``Yet Another Graph Partitioning Problem is NP-Hard" we present the surprising result that -Subgraph-Balanced-Vertex-Separator is -Hard. This is despite the fact that the constraints of our new problem are harder to satisfy than the original problem.
Cite
@article{arxiv.1403.5544,
title = {Yet Another Graph Partitioning Problem is NP-Hard},
author = {Ryan H. Lewis},
journal= {arXiv preprint arXiv:1403.5544},
year = {2014}
}