Layer-free upward crossing minimization

ACM Journal of Experimental Algorithmics

Volumn 15, Issue 1, 2010, Pages

  Chimani, Markus ^a   Gutwenger, Carsten ^a   Mutzel, Petra ^a   Wong, Hoi Ming ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Crossing number; Planarization approach; Upward drawing; Upward planarization

Indexed keywords

EID: 80054692341     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1671973.1671975     Document Type: Article

References (16)

1. BATINI, C., TALAMO, M., AND TAMASSIA, R. 1984. Computer-aided layout of entity relationship diagrams. J. Syst. Software 4, 2-3, 163-173.
2. BATTISTA, G. D., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1999. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River, NJ.
3. BERTOLAZZI, P., BATTISTA, G. D., LIOTTA, G., AND MANNINO, C. 1994. Upward drawingsoftriconnected digraphs. Algorithmica 12, 6, 476-497.
4. BERTOLAZZI, P., DI BATTISTA, G., MANNINO, C., AND TAMASSIA, R. 1998. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27, 1, 132-169.
5. DI BATTISTA, G., GARG, A., LIOTTA, G., PARISE, A., TAMASSIA, R., TASSINARI, E., VARGIU, F., AND VISMARA, L. 2000. Drawing directed acyclic graphs: An experimental study. Int. J. Comput. Geom. Appl. 10, 6, 623-648.
6. DI BATTISTA, G., GARG, A., LIOTTA, G., TAMASSIA, R., TASSINARI, E., AND VARGIU, F. 1997. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 7, 5-6, 303-325.
7. DOGRUSOZ, U., DUNCAN, C. A., GUTWENGER, C., AND SANDER, G. 2008. Graph drawing contest report. In Proceedings of the Symposium on Graph Drawing. Springer, Berlin.
8. EIGLSPERGER, M., KAUFMANN, M., AND EPPINGER, F. 2003. An approach for mixed upward planarization. J. Graph Algorithms Appl. 7, 2, 203-220.
9. EIGLSPERGER, M., SIEBENHALLER, M., AND KAUFMANN, M. 2004. An efficient implementation of Sugiyama's algorithm for layered graph drawing. In Proceedings of the Symposium on Graph Drawing. Springer, Berlin, 155-166.
10. GANSNER, E., KOUTSOFIOS, E., NORTH, S., AND VO, K.-P. 1993. A technique for drawing directed graphs. Softw. Pract. Exper. 19, 3, 214-229.
11. GARG, A. AND TAMASSIA, R. 2001. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31, 2, 601-625.
12. GOLDSCHMIDT, O. AND TAKVORIAN, A. 1994. An efficient graph planarization two-phase heuristic. Networks 24, 2, 69-73.
13. GUTWENGER, C. AND MUTZEL, P. 2004. An experimental study of crossing minimization heuristics. In Proceedings of the Symposium on Graph Drawing. Springer, Berlin, 13-24.
14. OGDF. Open graph drawing framework. TU Dortmund, Chair of Algorithm Engineering; Version v. 2007.11 (Bubinga). http://www.ogdf.net.
15. SIEBENHALLER, M. AND KAUFMANN, M. 2005. Mixed upward planarization - fast and robust. In Proceedings of the Symposium on Graph Drawing. Springer, Berlin, 522-523.
16. SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical system structures. IEEE Trans. Sys. Man. Cyb. 11, 2, 109-125.