Geodesic
A Fast Multi-Scale Method for Drawing Large Graphs
Journal of Graph Algorithms and Applications, Selected Papers from the 2000 Symposium on Graph Drawing , Tome 6 (2002) no. 3, pp. 179-202.

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

We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawing of a graph with over 15,000 vertices. Also we achieve "nice" drawings of 1000 vertex graphs in about 1 second. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the earlier multi-scale algorithm of Hadany and Harel []. In principle, it could significantly improve the speed of essentially any force-directed method (regardless of that method's ability of drawing weighted graphs or the continuity of its cost-function). 
@article{JGAA_2002_6_3_a1,
     author = {David Harel and Yehuda Koren},
     title = {A {Fast} {Multi-Scale} {Method} for {Drawing} {Large} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {179--202},
     publisher = {mathdoc},
     volume = {6},
     number = {3},
     year = {2002},
     doi = {10.7155/jgaa.00051},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00051/}
}
TY  - JOUR
AU  - David Harel
AU  - Yehuda Koren
TI  - A Fast Multi-Scale Method for Drawing Large Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2002
SP  - 179
EP  - 202
VL  - 6
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00051/
DO  - 10.7155/jgaa.00051
LA  - en
ID  - JGAA_2002_6_3_a1
ER  - 
%0 Journal Article
%A David Harel
%A Yehuda Koren
%T A Fast Multi-Scale Method for Drawing Large Graphs
%J Journal of Graph Algorithms and Applications
%D 2002
%P 179-202
%V 6
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00051/
%R 10.7155/jgaa.00051
%G en
%F JGAA_2002_6_3_a1
David Harel; Yehuda Koren. A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications, 
							Selected Papers from the 2000 Symposium on Graph Drawing
					, Tome 6 (2002) no. 3, pp. 179-202. doi : 10.7155/jgaa.00051. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00051/

Cité par Sources :