Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Journal of Graph Algorithms and Applications (2003)
- Volume: 7, Issue: 1, page 33-77
- ISSN: 1526-1719
Access Full Article
topHow to cite
topWood, David R.. "Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.." Journal of Graph Algorithms and Applications 7.1 (2003): 33-77. <http://eudml.org/doc/50438>.
@article{Wood2003,
author = {Wood, David R.},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {1},
pages = {33-77},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.},
url = {http://eudml.org/doc/50438},
volume = {7},
year = {2003},
}
TY - JOUR
AU - Wood, David R.
TI - Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
JO - Journal of Graph Algorithms and Applications
PY - 2003
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 7
IS - 1
SP - 33
EP - 77
LA - eng
UR - http://eudml.org/doc/50438
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.