A Note on the Complexity of One-Sided Crossing Minimization of Trees

06/27/2023

∙

by   Alexander Dobler, et al.

∙

0

∙

share

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.