Drawing clustered graphs on an orthogonal grid.
Eades, Peter; Feng, Qingwen; Nagamochi, Hiroshi
Journal of Graph Algorithms and Applications (1999)
- Volume: 3, Issue: 4, page 3-29
- ISSN: 1526-1719
Access Full Article
top
How to cite
topEades, Peter, Feng, Qingwen, and Nagamochi, Hiroshi. "Drawing clustered graphs on an orthogonal grid.." Journal of Graph Algorithms and Applications 3.4 (1999): 3-29. <http://eudml.org/doc/48709>.
@article{Eades1999,
author = {Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi},
journal = {Journal of Graph Algorithms and Applications},
keywords = {graphical representation; orthogonal grid rectangular cluster drawings; planar graphs; algorithm; number of bends},
language = {eng},
number = {4},
pages = {3-29},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Drawing clustered graphs on an orthogonal grid.},
url = {http://eudml.org/doc/48709},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Eades, Peter
AU - Feng, Qingwen
AU - Nagamochi, Hiroshi
TI - Drawing clustered graphs on an orthogonal grid.
JO - Journal of Graph Algorithms and Applications
PY - 1999
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 3
IS - 4
SP - 3
EP - 29
LA - eng
KW - graphical representation; orthogonal grid rectangular cluster drawings; planar graphs; algorithm; number of bends
UR - http://eudml.org/doc/48709
ER -
NotesEmbed ?
topYou 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.