Navigating Clustered Graphs Using Force-Directed Methods
Journal of Graph Algorithms and Applications, Selected Papers from the 1998 Symposium on Graph Drawing , Tome 4 (2000) no. 3, pp. 157-181.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

@article{JGAA_2000_4_3_a7,
     author = {Peter Eades and Mao Lin Huang},
     title = {Navigating {Clustered} {Graphs} {Using} {Force-Directed} {Methods}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {157--181},
     publisher = {mathdoc},
     volume = {4},
     number = {3},
     year = {2000},
     doi = {10.7155/jgaa.00029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00029/}
}
TY  - JOUR
AU  - Peter Eades
AU  - Mao Lin Huang
TI  - Navigating Clustered Graphs Using Force-Directed Methods
JO  - Journal of Graph Algorithms and Applications
PY  - 2000
SP  - 157
EP  - 181
VL  - 4
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00029/
DO  - 10.7155/jgaa.00029
LA  - en
ID  - JGAA_2000_4_3_a7
ER  - 
%0 Journal Article
%A Peter Eades
%A Mao Lin Huang
%T Navigating Clustered Graphs Using Force-Directed Methods
%J Journal of Graph Algorithms and Applications
%D 2000
%P 157-181
%V 4
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00029/
%R 10.7155/jgaa.00029
%G en
%F JGAA_2000_4_3_a7
Peter Eades; Mao Lin Huang. Navigating Clustered Graphs Using Force-Directed Methods. Journal of Graph Algorithms and Applications, 
							Selected Papers from the 1998 Symposium on Graph Drawing
					, Tome 4 (2000) no. 3, pp. 157-181. doi : 10.7155/jgaa.00029. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00029/

Cité par Sources :