Funder
National Research Foundation of Korea
ERATO
ARC
MEXT
University of Perugia
NSF
Subject
General Computer Science,Theoretical Computer Science
Reference47 articles.
1. On the size of planarly connected crossing graphs;Ackerman,2016
2. On the maximum number of edges in quasi-planar graphs;Ackerman;J. Combin. Theory Ser. A,2007
3. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997
4. On the relationship between k-planar and k-quasi planar graphs;Angelini,2017
5. The haloed line effect for hidden line elimination;Appel;SIGGRAPH Comput. Graph.,1979
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献