Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference49 articles.
1. Bhasker, J., and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph,Algorithmica 3 (1988), 147–178.
2. Biedl, T., and G. Kant, A better heuristic for planar orthogonal drawings, inProc. 2nd European Symp. on Algorithms (ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, Berlin, 1994, pp. 24–36.
3. Booth, K. S., and G. S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity testing using PQ-tree algorithms,J. Comput. System Sci. 13 (1976), 335–379.
4. Chiba, N., T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees,J. Comput. System Sci. 30 (1985), 54–76.
5. Chiba, N., K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely,Acta Inform. 22 (1985), 187–201.
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献