2000 character limit reached
A Note on the Complexity of One-Sided Crossing Minimization of Trees (2306.15339v1)
Published 27 Jun 2023 in cs.CC
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.