Author:
Rahman Md.Saidur,Nishizeki Takao
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall Inc., Upper Saddle River, New Jersey, 1999.
2. G. Di Battista, G. Liotta, and F. Vargiu, Spirality and optimal orthogonal drawings, SIAM J. Comput. 27(6), pp. 1764–1811, 1998.
3. A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing’96, Lect. Notes in Computer Science, 1190, pp. 201–226, 1997.
4. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.
5. S. Nakano and M. Yoshikawa, A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs, Proc. of Graph Drawing’00, Lect. Notes in Computer Science, 1984, pp. 296–307, 2001.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献