Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Bhasker, J., and S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 7 (1987), pp. 307–317.
2. Bhasker, J., and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988), pp. 247–178.
3. Eades, P., and R. Tamassia, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Technical Report CS-89-09, 1989.
4. Fraysseix, H. de, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41–51.
5. He, X., On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., to appear.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献