An approach for mixed upward planarization

Journal of Graph Algorithms and Applications

Volumn 7, Issue 2, 2003, Pages 203-220

  Eiglsperger, Markus ^a   Eppinger, Frank ^a   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; DRAWING (GRAPHICS); HEURISTIC METHODS;

GENERALISATION; GRAPH DRAWING; GRAPH DRAWING ALGORITHMS; HEURISTICS APPROACHES; LARGE GRAPHS; MIXED GRAPH; PLANAR GRAPH; PLANARIZATION; RUNNING TIME; UNDIRECTED GRAPH;

UNDIRECTED GRAPHS;

EID: 4043175440     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00067     Document Type: Conference Paper

References (24)

1. T. Asano, H. Imai, and A. Mukaiyama. Finding a maximum weight independent set of a circle graph. IEICE Tranactions, E74:681-683, 1991.
2. C. Batini, E Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Softw. Eng., SE-12(4):538-546, 1986.
3. P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476-497, 1996.
4. G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language. Addison-Weslay, 1999.
5. R. Cimikowski. An analysis of heuristics for the maximum planar subgraph problem. In Proceedings of the 6th ACM-SIAM Symposium of Discrete Algorithms, pages 322-331, 1995.
6. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algortihms. Comput. Geom. Theory Appl., 7:303-325, 1997.
8. R. Dial. Algorithm 360: Shortest path forest with topological ordering. Communications of ACM, 12:632-633, 1969.
9. M. Eiglsperger, U. Foessmeier, and M. Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pages 3-11, 2000.
10. A. Garg and R. Tamassia. On the complexity of upward and rectilinear planarity testing. In Proceedings of the 2nd International Symposium on Graph Drawing (GD'94), volume 894 of LNCS, pages 286-297, 1995.
11. O. Goldschmidt and A. Takvorian. An efficient graph planarization two-phase heuristic. Networks, 24:69-73, 1994.
12. R. Jayakumar, K. Thulasiraman, and M. N. S. Swamy. o(n2) algorithms for graph planarization. In IEEE Trans. on CAD, volume 8 (3), pages 257-267, 1989.
13. M. Jünger and S. Leipert. Level planar embedding in linear time. In J. Kratochvil, editor, Proceedings of the 7th International Symposium on Graph Drawing, volume 1547, pages 72-81. Springer Verlag, 2000.
14. M. Jünger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. In Proceedings of the 6th International Symposium on Graph Drawing (GD'98), volume 1547 of LNCS, pages 224-237, 1998.
15. M. Jünger and P. Mutzel. Solving the maximum weight planar subgraph problem by branch & cut. In Proc. of the 3rd conference on integer programming and combinatorial optimization (IPCO), pages 479-492, 1993.
16. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA), 1(1):1-25, 1997.
17. 2) maximal planarization algorithm based on PQ-trees. Technical Report RUU-CS-92-03, CS Dept., Univ. Utrecht, Netherlands, 1992.
18. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
19. W. Didimo P. Bertolazzi, G. Di Battista. Quasi-upward planarity. Algorithmica, 32(3):474-506, 2002.
20. M. Resende and C. Ribeiro. A grasp for graph planarization. Networks, 29:173-189, 1997.
21. J. Seemann. Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In Proceedings of the 5th International Symposium on Graph Drawing (GD'97), volume 1353 of LNCS, pages 415-424, 1997.
22. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, February 1981.
23. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421-444, 1987.
24. R. Wiese, M. Eiglsperger, and M. Kaufmann. yfiles: Visualization and automatic layout of graphs. In Proceedings of the 9th International Symposium on Graph Drawing (GD'01), LNCS, pages 453-454. Springer, 2001.