2-layer straightline crossing minimization: Performance of exact and heuristic algorithms.

Jünger, Michael; Mutzel, Petra

Journal of Graph Algorithms and Applications (1997)

  • Volume: 1, page Paper 1, 25 p.-Paper 1, 25 p.
  • ISSN: 1526-1719

How to cite

top

Jünger, Michael, and Mutzel, Petra. "2-layer straightline crossing minimization: Performance of exact and heuristic algorithms.." Journal of Graph Algorithms and Applications 1 (1997): Paper 1, 25 p.-Paper 1, 25 p.. <http://eudml.org/doc/48063>.

@article{Jünger1997,
author = {Jünger, Michael, Mutzel, Petra},
journal = {Journal of Graph Algorithms and Applications},
keywords = {bipartite graph; crossing number; heuristics},
language = {eng},
pages = {Paper 1, 25 p.-Paper 1, 25 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {2-layer straightline crossing minimization: Performance of exact and heuristic algorithms.},
url = {http://eudml.org/doc/48063},
volume = {1},
year = {1997},
}

TY - JOUR
AU - Jünger, Michael
AU - Mutzel, Petra
TI - 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms.
JO - Journal of Graph Algorithms and Applications
PY - 1997
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 1
SP - Paper 1, 25 p.
EP - Paper 1, 25 p.
LA - eng
KW - bipartite graph; crossing number; heuristics
UR - http://eudml.org/doc/48063
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.