Minimum Bisection is NP-hard on Unit Disk Graphs
arXiv:1404.0117
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.
17 pages, 6 figures
arXiv:1404.0117
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.
17 pages, 6 figures