Abstract
We present an extensive experimental study of heuristics for crossing minimization. The heuristics are based on the planarization approach, so far the most successful framework for crossing minimization. We study the effects of various methods for computing a maximal planar subgraph and for edge re-insertion including post-processing and randomization.
Chapter PDF
References
Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM Journal on Computing 25(5), 956–997 (1996)
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI layout problems. Journal of Computer and System Sciences 28, 300–343 (1984)
Bienstock, D.: Some provablyhard crossing number problems. Discrete & Computational Geometry 6, 443–459 (1991)
Brandenburg, F.J., Himsolt, M., Rohrer, C.: An experimental comparison of force-directed and randomized graph drawing algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 76–87. Springer, Heidelberg (1996)
Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci. 30(1), 54–76 (1985)
Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 7, 303–326 (1997)
Eschbach, T., Günther, W., Drechsler, R., Becker, B.: Crossing reduction by windows optimization. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 285–294. Springer, Heidelberg (2002)
Even, G., Guha, S., Schieber, B.: Improved approximations of crossings in graph drawing and VLSI layout area. In: Proc. 32nd ACM Symp. Theory of Comp. (STOC 2000), pp. 296–305. ACM Press, New York (2000)
Grohe, M.: Computing crossing numbers in quadratic time. In: Proc. 32nd ACM Symp. Theory of Computing (STOC 2000), pp. 231–236. ACM Press, New York (2000)
Gutwenger, C., Klein, K., Kupke, J., Leipert, S., Jünger, M., Mutzel, P.: Govisual software tools (2002), http://www.oreas.de
Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: Proc. Ninth Ann. ACM-SIAM Symp. Discr. Algorithms (SODA 2001), Washington, DC, pp. 246–255. ACM Press, New York (2001)
Jayakumar, R., Thulasiraman, K., Swamy, M.N.S.: O(n 2) algorithms for graph planarization. IEEE Trans. on Computer-Aided Design 8, 257–267 (1989)
Johnson, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312–316 (1983)
Jünger, M., Leipert, S., Mutzel, P.: A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. Computer-Aided Design 17(7) (1998)
Jünger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16(1), 33–59 (1996)
Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Gr. Alg. & Appl. (JGAA) 1(1), 1–25 (1997)
Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)
Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: 10th. S-E Conf. Comb., Graph Theory, and Comp., pp. 727–738 (1977)
Mehlhorn, K., Mutzel, P.: On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica 16(2), 233–242 (1996)
Mutzel, P., Ziegler, T.: The constrained crossing min. problem. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 175–185. Springer, Heidelberg (1999)
La Poutré, J.A.: Alpha-algorithms for incremental planaritytesting. In: Proc. 26th Annual ACM Symp. Theory of Computation (STOC), pp. 706–715 (1994)
Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)
Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. In: Amer. Math. Monthly, pp. 131–137 (1997)
Vismara, L., Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Vargiu, F.: Experimental studies on graph drawing algorithms. Software – Practice and Experience 30, 1235–1284 (2000)
Ziegler, T.: Crossing Minimization in Automatic Graph Drawing. PhD thesis, Max-Planck-Institut für Informatik, Saarbrücken (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutwenger, C., Mutzel, P. (2004). An Experimental Study of Crossing Minimization Heuristics. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive