Testing Upward Planarity of Partial $2$-Trees

Steven Chaplick,Emilio Di Giacomo,Fabrizio Frati,Robert Ganian,Chrysanthi N. Raftopoulou,Kirill Simonov

arxiv（2022）

引用 1|浏览9

暂无评分

摘要

We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.

查看译文

关键词

upward planarity

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要