The Importance of Being Proper
Theoretical Computer Science(2014)
摘要
In this paper we study two problems related to the drawing of level graphs, that is, T -Level Planarity and Clustered-Level Planarity. We show that both problems are $\mathcal{NP}$ -complete in the general case and that they become polynomial-time solvable when restricted to proper instances.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络