Minimum bisection is NP-hard on unit disk graphs

Josep Díaz, George B Mertzios

Open Access

https://doi.org/10.1016/j.ic.2017.04.010

Copy DOI

Journal: Information and Computation	Publication Date: Apr 28, 2017
Citations: 31	License type: cc-by-nc-nd

Abstract

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

Published version (

Free)

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author