Geodesic
Drawing graphs using modular decomposition
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Thirteenth International Symposium on Graph Drawing, GD 2005 , Tome 11 (2007) no. 2, pp. 481-511.

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

In this paper we present an algorithm for drawing an undirected graph G that takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aesthetically pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a well-known spring embedder algorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n+m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria. 
@article{JGAA_2007_11_2_a7,
     author = {Charis Papadopoulos and Costas Voglis},
     title = {Drawing graphs using modular decomposition},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {481--511},
     publisher = {mathdoc},
     volume = {11},
     number = {2},
     year = {2007},
     doi = {10.7155/jgaa.00155},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00155/}
}
TY  - JOUR
AU  - Charis Papadopoulos
AU  - Costas Voglis
TI  - Drawing graphs using modular decomposition
JO  - Journal of Graph Algorithms and Applications
PY  - 2007
SP  - 481
EP  - 511
VL  - 11
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00155/
DO  - 10.7155/jgaa.00155
LA  - en
ID  - JGAA_2007_11_2_a7
ER  - 
%0 Journal Article
%A Charis Papadopoulos
%A Costas Voglis
%T Drawing graphs using modular decomposition
%J Journal of Graph Algorithms and Applications
%D 2007
%P 481-511
%V 11
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00155/
%R 10.7155/jgaa.00155
%G en
%F JGAA_2007_11_2_a7
Charis Papadopoulos; Costas Voglis. Drawing graphs using modular decomposition. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Thirteenth International Symposium on Graph Drawing, GD 2005
					, Tome 11 (2007) no. 2, pp. 481-511. doi : 10.7155/jgaa.00155. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00155/

Cité par Sources :