Author:
Rahman Md. Saidur,Nakano Shin-ichi,Nishizeki Takao
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. T. C. Biedl, Optimal orthogonal drawings of triconnected plane graphs, Proc. SWAT’96, Lect. Notes in Compute Science, Springer, 1097 (1996), pp. 333–344.
2. T. C. Biedl and M. Kaufmann, Area-efficient static and incremental graph drawings, Proc. of 5th European Symposium on Algorithms, Lect. Notes in Computer Science, Springer, 1284 (1997), pp. 37–52.
3. T. Calamoneri and R. Petreschi, Orthogonally drawing cubic graphs in parallel, Journal of Parallel and Distributed Comp., 55 (1998), pp. 94–108.
4. G. de Battista, P. Eades, R. Tamassia and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comp. Geom. Theory Appl., 4 (1994), pp. 235–282.
5. U. Fößmeier, G. Kant and M. Kaufmann, 2-visibility drawings of plane graphs, Proc. of Graph Drawing’ 96, Lect. Notes in Compute Science, Springer, 1190 (1997), pp. 155–168.