Author:
Di Battista Giuseppe,Didimo Walter,Marcandalli A.
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. AGD. A library of algorithms for graph drawing. Online. http://www.mpi-sb.mpg.de/AGD/ .
2. P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.
3. U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Graph Drawing (Proc. GD’ 00), volume 1984of Lecture Notes Comput. Sci., pages 103–114. Springer-Verlag, 2000.
4. Lect Notes Comput Sci;G. Battista Di,1999
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献