A Note on the Complexity of One-Sided Crossing Minimization of Trees
Computational Complexity
2023-06-28 v1
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.
Cite
@article{arxiv.2306.15339,
title = {A Note on the Complexity of One-Sided Crossing Minimization of Trees},
author = {Alexander Dobler},
journal= {arXiv preprint arXiv:2306.15339},
year = {2023}
}
Comments
3 pages, 2 figures