In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Díaz, J., & Mertzios, G. B. (2014). Minimum bisection is NP-hard on unit disk graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 251–262). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_22
Mendeley helps you to discover research relevant for your work.