Abstract
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller layer contains up to 15 nodes. For bigger instances, the iterated barycenter method turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing the results to optimum solutions.
Partially supported by DFG-Grant Ju204/7-1, Forschungsschwerpunkt “Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen”
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
CPLEX: Using the CPLEX callable library and the CPLEX mixed integer library. CPLEX Optimization Inc. (1993)
Dresbach, S.: A New Heuristic Layout Algorithm for DAGs. Derigs, Bachern & Drexl (eds.) Operations Research Proceedings 1994, Springer Verlag, Berlin (1994) 121–126
Dresbach, S.: Personal communication. (1995)
Eades, P., and D. Kelly: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combinatoria 21-A (1986) 89–98
Eades, P., and N.C. Wormald: Edge crossings in Drawings of Bipartite Graphs. Algorithmica 10 (1994) 379–403
Garey, M.R., and D.S. Johnson: Crossing Number is NP-Complete. SIAM J. on Algebraic and Discrete Methods 4 (1983) 312–316
Grötschel, M., M. Jünger, and G. Reinelt: A cutting plane algorithm for the linear ordering problem. Operations Research 32 (1984) 1195–1220
Grötschel, M., M. Jünger, and G. Reinelt: Optimal triangulation of large real world input-output matrices. Statistische Hefte 25 (1984) 261–295
Grötschel, M., M. Jünger, and G. Reinelt: Facets of the linear ordering polytope. Mathematical Programming 33 (1985) 43–60
Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, Addison-Wesley Publishing Company (1993) New York
Sugiyama, K., S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical System Structures. IEEE Trans. Syst. Man, Cybern., SMC-11 (1981) 109–125
Warfield, J.N.: Crossing Theory and Hierarchy Mapping. IEEE Trans. Syst. Man, Cybern., SMC-7 (1977) 505–523
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jünger, M., Mutzel, P. (1996). Exact and heuristic algorithms for 2-layer straightline crossing minimization. In: Brandenburg, F.J. (eds) Graph Drawing. GD 1995. Lecture Notes in Computer Science, vol 1027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021817
Download citation
DOI: https://doi.org/10.1007/BFb0021817
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60723-6
Online ISBN: 978-3-540-49351-8
eBook Packages: Springer Book Archive