We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Minimum bisection is NP-hard on unit disk graphs.

Diaz, J. and Mertzios, G.B. (2017) 'Minimum bisection is NP-hard on unit disk graphs.', Information and computation., 256 . pp. 83-92.


In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2016 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:08 September 2016
Date deposited:12 September 2016
Date of first online publication:28 April 2017
Date first made open access:28 April 2018

Save or Share this output

Look up in GoogleScholar