Abstract
We present computational results of an implementation based on the fixed parameter tractability (FPT) approach for biplanarizing graphs. These results show that the implementation can efficiently minimum biplanarizing sets containing up to about 18 edges, thus making it comparable to previous integer linear programming approaches. We show how our implementation slightly improves the theoretical running time to O(6bpr(G) + |G |). Finally, we explain how our experimental work predicts how performance on sparse graphs may be improved.
Chapter PDF
Similar content being viewed by others
References
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)
Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)
Dujmović, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to two-layer planarization. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 1–15. Springer, Heidelberg (2002)
Dujmović, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to two-layer planarization (2003) (manuscript)
Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proceedings of the 9th Australian Computer Science Conference, pp. 327–334. Australian National University (1986)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal of Algebraic Discrete Methods 4, 312–316 (1983)
Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica 1, 203–209 (1972)
Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1, 1–25 (1997)
Jünger, M., Thienel, S.: The ABACUS-system for branch and cut and price algorithms in integer programming and combinatorial optimization. In: Software–Practice and Experience, vol. 30, pp. 1324–1352 (2000)
Knuth, D.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press/Addison-Wesley Publishing Company (1993)
Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester (1990)
Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 318–333. Springer, Heidelberg (1997)
Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM Journal of Optimization 11, 1065–1080 (2001)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 109–125 (1981)
Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Papers of tech. group on elect. comp., IECEJ EC77-38, 1–12 (1977)
Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man, and Cybernetics 7, 502–523 (1977)
Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology 48, 189–195 (1986)
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
Suderman, M., Whitesides, S. (2004). Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. 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_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive