How to layer a directed acyclic graph

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

Volumn 2265 LNCS, Issue , 2002, Pages 16-30

  Healy, Patrick ^a   Nikolov, Nikola S ^a  

^a UNIVERSITY OF LIMERICK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); ALGORITHMS; GRAPH THEORY;

DIMENSION CONSTRAINTS; DIRECTED ACYCLIC GRAPH (DAG); EDGE SPAN; EDGE WIDTHS; EXPERIMENTAL ANALYSIS; SPECIFIC INFORMATION;

DIRECTED GRAPHS;

EID: 84867461110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_2     Document Type: Conference Paper

References (6)

1. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, (7):303 - 316, 1997.
2. Fr. Brandenburg, Ul. Brandes, M. Himsolt, and M. Raitner. Graph-drawing contest report. In Joe Marks, editor, Graph Drawing: Proceedings of 8th International Symposium, GD 2000, pages 410 - 418. Springer-Verlag, 2000.
3. E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200-213, 1972.
4. P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424-437, 1990.
5. E. Gansner, E. Koutsofios, S. North, and K. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214-229, March 1993.
6. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, SMC-11(2):109-125, February 1981.