Author:
Rahman Saidur,Nakano Shin-ichi,Nishizeki Takao
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3 (1988), pp. 247–278.
2. N. Chiba, K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely, Acta Informatica, 22 (1985), pp. 187–201.
3. M. Chiobak and S. Nakano, Minimum-width grid drawings of plane graphs, Technical Report, UCR-CS-94-5, Department of Computer Science, University of California at Riverside, 1994.
4. G. de Battista, P. Eades, R. Tamassia and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comp. Geom. Theory Appl., to appear.
5. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41–51.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献