Minimum Bisection is NP-hard on Unit Disk Graphs
Computational Complexity
2017-04-28 v3 Combinatorics
Abstract
In this paper we prove that the \textsc{Min-Bisection} problem is NP-hard on \emph{unit disk graphs}, thus solving a longstanding open question.
Cite
@article{arxiv.1404.0117,
title = {Minimum Bisection is NP-hard on Unit Disk Graphs},
author = {Josep Diaz and George B. Mertzios},
journal= {arXiv preprint arXiv:1404.0117},
year = {2017}
}
Comments
17 pages, 6 figures