A Note on the Complexity of One-Sided Crossing Minimization of Trees
arXiv:2306.15339
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.
arXiv comment3 pages, 2 figures