2000 character limit reached
Yet Another Graph Partitioning Problem is NP-Hard (1403.5544v1)
Published 21 Mar 2014 in cs.CC and cs.DS
Abstract: 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 variant, has been overlooked. In this work ``Yet Another Graph Partitioning Problem is NP-Hard" we present the surprising result that $\alpha$-Subgraph-Balanced-Vertex-Separator is $NP$-Hard. This is despite the fact that the constraints of our new problem are harder to satisfy than the original problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.