Article ID Journal Published Year Pages File Type
4950577 Information and Computation 2017 10 Pages PDF
Abstract
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Minimum bisection is NP-hard on unit disk graphs
Authors
, ,