J. Díaz
Minimum Bisection Is NP-hard on Unit Disk Graphs
Díaz, J.; Mertzios, G.B.
Authors
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Contributors
Erzsébet Csuhaj-Varjú
Editor
Martin Dietzfelbinger
Editor
Zoltán Ésik
Editor
Abstract
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.
Citation
Díaz, J., & Mertzios, G. (2014). Minimum Bisection Is NP-hard on Unit Disk Graphs. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), Mathematical foundations of computer science 2014 : 39th international symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, part II (251-262). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_22
Publication Date | 2014 |
---|---|
Deposit Date | Sep 8, 2014 |
Publicly Available Date | Sep 17, 2014 |
Publisher | Springer Verlag |
Pages | 251-262 |
Series Title | Lecture notes in computer science |
Book Title | Mathematical foundations of computer science 2014 : 39th international symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, part II. |
ISBN | 9783662444641 |
DOI | https://doi.org/10.1007/978-3-662-44465-8_22 |
Keywords | Minimum bisection problem, Unit disk graphs, Planar graphs, NP-hardness. |
Public URL | https://durham-repository.worktribe.com/output/1677761 |
Related Public URLs | http://link.springer.com/chapter/10.1007%2F978-3-662-44465-8_22 |
Files
Accepted Book Chapter
(390 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44465-8_22
You might also like
The complexity of computing optimum labelings for temporal connectivity
(2022)
Presentation / Conference Contribution
The complexity of temporal vertex cover in small-degree graphs
(2022)
Presentation / Conference Contribution
The complexity of transitively orienting temporal graphs
(2021)
Presentation / Conference Contribution
Equitable scheduling on a single machine
(2021)
Presentation / Conference Contribution
Exact and approximate algorithms for computing a second Hamiltonian cycle
(2020)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search