A Note on the Complexity of One-Sided Crossing Minimization of Trees
Abstract
In 2011, Harrigan and Healy published a polynomial-time algorithm for one-sided crossing minimization for trees. We point out a counterexample to that algorithm, and show that one-sided crossing minimization is NP-hard for trees.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2023
- DOI:
- 10.48550/arXiv.2306.15339
- arXiv:
- arXiv:2306.15339
- Bibcode:
- 2023arXiv230615339D
- Keywords:
-
- Computer Science - Computational Complexity
- E-Print:
- 3 pages, 2 figures