J. Diaz
Minimum bisection is NP-hard on unit disk graphs
Diaz, J.; Mertzios, G.B.
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
Diaz, J., & Mertzios, G. (2017). Minimum bisection is NP-hard on unit disk graphs. Information and Computation, 256, 83-92. https://doi.org/10.1016/j.ic.2017.04.010
Journal Article Type | Article |
---|---|
Acceptance Date | Sep 8, 2016 |
Online Publication Date | Apr 28, 2017 |
Publication Date | Apr 28, 2017 |
Deposit Date | Sep 12, 2016 |
Publicly Available Date | Apr 28, 2018 |
Journal | Information and Computation |
Print ISSN | 0890-5401 |
Electronic ISSN | 1090-2651 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 256 |
Pages | 83-92 |
DOI | https://doi.org/10.1016/j.ic.2017.04.010 |
Public URL | https://durham-repository.worktribe.com/output/1405110 |
Files
Accepted Journal Article
(415 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright 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/
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