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.
|Full text:||(AM) Accepted Manuscript|
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF (406Kb)
|Publisher Web site:||https://doi.org/10.1016/j.ic.2017.04.010|
|Publisher statement:||© 2016 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/|
|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|