On metro-line crossing minimization.
Argyriou, Evmorfia; Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios
Journal of Graph Algorithms and Applications (2010)
- Volume: 14, Issue: 1, page 75-96
- ISSN: 1526-1719
Access Full Article
topHow to cite
topArgyriou, Evmorfia, et al. "On metro-line crossing minimization.." Journal of Graph Algorithms and Applications 14.1 (2010): 75-96. <http://eudml.org/doc/225725>.
@article{Argyriou2010,
author = {Argyriou, Evmorfia, Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios},
journal = {Journal of Graph Algorithms and Applications},
keywords = {graph drawing; crossing; metro-line crossing minimization; MLCM},
language = {eng},
number = {1},
pages = {75-96},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {On metro-line crossing minimization.},
url = {http://eudml.org/doc/225725},
volume = {14},
year = {2010},
}
TY - JOUR
AU - Argyriou, Evmorfia
AU - Bekos, Michael A.
AU - Kaufmann, Michael
AU - Symvonis, Antonios
TI - On metro-line crossing minimization.
JO - Journal of Graph Algorithms and Applications
PY - 2010
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 14
IS - 1
SP - 75
EP - 96
LA - eng
KW - graph drawing; crossing; metro-line crossing minimization; MLCM
UR - http://eudml.org/doc/225725
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.