Author:
Battista Giuseppe Di,Tamassia Roberto,Tollis Ioannis G.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference47 articles.
1. P. Bertolazzi and G. Di Battista, On upward drawing testing of triconnected digraphs,Proceedings of the ACM Symposium on Computational Geometry, 1991, pp. 272–280.
2. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees,Journal of Computer and System Sciences 30 (1985), 54–76.
3. N. Chiba, K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely,Acta Informatica 22 (1985), 187–201.
4. M. Chrobak, A linear-time algorithm for drawing a planar graph on a grid, Manuscript, University of California, Riverside, 1988.
5. G. Di Battista, W.-P. Liu, and I. Rival, Bipartite graphs, upward drawings, and planarity,Information Processing Letters 36 (1990), 317–322.
Cited by
98 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献