Area-efficient static and incremental graph drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 37-52

  Biedl, Therese C ^a   Kaufmann, Michael ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; GRAPHIC METHODS;

ARBITRARY GRAPHS; AREA-EFFICIENT; COMPLETE GRAPHS; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; OUTER PLANAR GRAPHS; STATIC SCENARIOS; UPPER AND LOWER BOUNDS;

GRAPH THEORY;

EID: 84949199857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_4     Document Type: Conference Paper

References (16)

1. T. Biedl, B. Madden, and I. Tollis. The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Tech. Report, University of Texas at Dallas. UT-DCS 03-97, 1997.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, McGraw-Hill Book Company, 1990.
3. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4(5):235-282, 1994.
4. P.F. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th Annual ACM Symp. Theory of Computing, pp. 365-372, 1987.
5. S. Even and R.E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:436-441, 1976.
6. U. Fößmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In S. North, editor, Symp. on Graph Drawing, GD 96, volume 1190 of Lecture Notes in Computer Science, pp. 155-168. Springer Verlag, 1997.
7. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. Brandenburg, editor, Symp. on Graph Drawing, GD 95, volume 1027 of Lecture Notes in Computer Science, pp. 254-266. Springer Verlag, 1996.
8. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
9. J. Hutchinson, T. Shermer, and A. Vince. On representation of some thickness-two graphs. In F. Brandenburg, editor, Symp. on Graph Drawing, GD 95, volume 1027 of Lecture Notes in Computer Science, pp. 324-332. Springer Verlag, 1996.
10. G. Kant. Algorithms for Drawing Planar Graphs. PhD thesis, Univ. Utrecht, 1993.
11. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Proc. of Theory of Graphs, Int. Symp. Rome, pp. 215-232. 1966.
12. A. Papakostas and I. Tollis. Issues in interactive orthogonal graph drawing. In F. Brandenburg, editor, Symp. on Graph Drawing, GD 95, volume 1027 of Lecture Notes in Computer Science, pp. 419-430. Springer Verlag, 1996.
13. A. Papakostas and I. Tollis. High-degree orthogonal drawings with small grid-size and few bends. Workshop on Algorithms and Data Structures, WADS 97, Lecture Notes in Computer Science. To appear.
14. P. Rosenstiehl and E. Tarjan. Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discrete Computational Geometry, 1:343-353, 1986.
15. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans, on Systems, Man and Cybernetics, 18(1), 1988.
16. R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry, 1:321-341, 1986.