加载中…
2024-09-03
Level Planarity Is More Difficult Than We Thought
Simon D. FinkMatthias PfretzschnerIgnaz RutterPeter Stumpf
文献摘要
We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本