Author:
Chimani Markus,Mutzel Petra,Schmidt Jens M.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. OGDF - Open Graph Drawing Framework. University of Dortmund, Chair of Algorithm Engineering, Website under Construction (2007)
2. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 7(5-6), 303–325 (1997)
3. Lecture Notes in Computer Science;J.M. Boyer,2004
4. Boyer, J.M., Myrvold, W.J.: Stop minding your P’s and Q’s: A simplified O(n) planar embedding algorithm. In: Proc. SODA 1999, pp. 140–146. SIAM, Philadelphia, PA (1999)
5. Boyer, J.M., Myrvold, W.J.: On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms an Applications 8(3), 241–273 (2004)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献