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

CoRR（2023）

引用 0|浏览2

暂无评分

摘要

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.

查看译文

关键词

complexity,minimization,one-sided

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要