2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

@article{Jnger19972LayerSC,
  title={2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms},
  author={Michael J{\"u}nger and Petra Mutzel},
  journal={J. Graph Algorithms Appl.},
  year={1997},
  volume={1}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
128 Extracted Citations
14 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Heuristics for reducing crossings in 2-layered networks

  • P. Eades, D. Kelly
  • Ars Combin., 21.A:89–98,
  • 1986
Highly Influential
7 Excerpts

Crossing number is NP-complete

  • M. Garey, D. Johnson
  • SIAM J. Algebraic Discrete Methods, 4:312–316,
  • 1983
Highly Influential
6 Excerpts

A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

  • V. Valls, R. Marti, P. Lino
  • Journal of Operational Research, 90:303–319,
  • 1996

Similar Papers

Loading similar papers…