Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website
@article{JGAA_1999_3_4_a1,
author = {Peter Eades and Qingwen Feng and Hiroshi Nagamochi},
title = {Drawing {Clustered} {Graphs} on an {Orthogonal} {Grid}},
journal = {Journal of Graph Algorithms and Applications},
pages = {3--29},
publisher = {mathdoc},
volume = {3},
number = {4},
year = {1999},
doi = {10.7155/jgaa.00016},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00016/}
}
TY - JOUR AU - Peter Eades AU - Qingwen Feng AU - Hiroshi Nagamochi TI - Drawing Clustered Graphs on an Orthogonal Grid JO - Journal of Graph Algorithms and Applications PY - 1999 SP - 3 EP - 29 VL - 3 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00016/ DO - 10.7155/jgaa.00016 LA - en ID - JGAA_1999_3_4_a1 ER -
%0 Journal Article %A Peter Eades %A Qingwen Feng %A Hiroshi Nagamochi %T Drawing Clustered Graphs on an Orthogonal Grid %J Journal of Graph Algorithms and Applications %D 1999 %P 3-29 %V 3 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00016/ %R 10.7155/jgaa.00016 %G en %F JGAA_1999_3_4_a1
Peter Eades; Qingwen Feng; Hiroshi Nagamochi. Drawing Clustered Graphs on an Orthogonal Grid. 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. 3-29. doi : 10.7155/jgaa.00016. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00016/
Cité par Sources :