Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website
@article{JGAA_1999_3_4_a3,
author = {T. Biedl and T. Shermer and S. Whitesides and S. Wismath},
title = {Bounds {For} {Orthogonal} {3-D} {Graph} {Drawing}},
journal = {Journal of Graph Algorithms and Applications},
pages = {63--79},
publisher = {mathdoc},
volume = {3},
number = {4},
year = {1999},
doi = {10.7155/jgaa.00018},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00018/}
}
TY - JOUR AU - T. Biedl AU - T. Shermer AU - S. Whitesides AU - S. Wismath TI - Bounds For Orthogonal 3-D Graph Drawing JO - Journal of Graph Algorithms and Applications PY - 1999 SP - 63 EP - 79 VL - 3 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00018/ DO - 10.7155/jgaa.00018 LA - en ID - JGAA_1999_3_4_a3 ER -
%0 Journal Article %A T. Biedl %A T. Shermer %A S. Whitesides %A S. Wismath %T Bounds For Orthogonal 3-D Graph Drawing %J Journal of Graph Algorithms and Applications %D 1999 %P 63-79 %V 3 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00018/ %R 10.7155/jgaa.00018 %G en %F JGAA_1999_3_4_a3
T. Biedl; T. Shermer; S. Whitesides; S. Wismath. Bounds For Orthogonal 3-D Graph Drawing. Journal of Graph Algorithms and Applications, New Trends in Graph Drawing: Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing , Tome 3 (1999) no. 4, pp. 63-79. doi : 10.7155/jgaa.00018. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00018/
Cité par Sources :