P. J. Carrington, J. Scott, and S. Wasserman, Models and methods in social network analysis, 2005.
DOI : 10.1017/CBO9780511811395

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering Software Practice and Experience, pp.1203-1233, 2000.
DOI : 10.1002/1097-024x(200009)30:11<1203::aid-spe338>3.3.co;2-e
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5621

R. F. Cancho, C. Janssen, and R. V. Solé, Topology of technology graphs: Small world patterns in electronic circuits, Physical Review E, vol.64, issue.4, p.46119, 2001.
DOI : 10.1103/PhysRevE.64.046119

S. B. Navathe and M. Ra, Vertical partitioning for database design: a graphical algorithm, ACM SIGMOD Record, vol.18, issue.2, pp.440-450, 1989.
DOI : 10.1145/66926.66966

T. M. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Software: Practice and Experience, vol.41, issue.11, pp.1129-1164, 1991.
DOI : 10.1002/spe.4380211102

T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, vol.31, issue.1, pp.7-15, 1989.
DOI : 10.1016/0020-0190(89)90102-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.7401

S. Hachul and M. Jünger, An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs, Pro. of the Graph Drawing Lecture Notes in Computer Science, vol.3843, pp.235-250, 2005.
DOI : 10.1007/11618058_22

U. Brandes, Layout of Graph Visualizations, 1999.

T. Biedl and F. J. Brandenburg, Graph-Drawing Contest Report, Proc. of the Graph drawing, pp.388-403, 2001.
DOI : 10.1007/3-540-45848-4_60

M. Storey and H. Müller, Graph layout adjustment strategies, Graph Drawing, pp.487-499, 1996.
DOI : 10.1007/BFb0021833
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.4243

W. T. Tutte, How to Draw a Graph, Proc. London Math. Society, pp.743-768, 1963.
DOI : 10.1112/plms/s3-13.1.743
URL : http://plms.oxfordjournals.org/cgi/content/short/s3-13/1/743

G. , D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, 1998.
DOI : 10.1007/978-3-642-00219-9

S. G. Kobourov, Force-Directed Drawing Algorithms Handbook of Graph Drawing and Visualization, pp.383-408, 2013.

C. Görg, P. Birke, M. Pohl, and S. Diehl, Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs, Graph Drawing, pp.228-238, 2005.
DOI : 10.1007/978-3-540-31843-9_24

U. Dogrusöz, B. Madden, and P. Madden, Circular Layout in the Graph Layout Toolkit, Proc. GD '96, pp.92-100, 1997.

G. Melancon and I. Herman, Circular drawings of rooted trees

P. Eades, A heuristic for graph drawing, Congressus Numerantium, vol.42, issue.11, pp.149-160, 1984.

P. Gajer and S. G. Kobourov, GRIP: Graph Drawing with Intelligent Placement, Journal of Graph Algorithms and Applications, vol.6, issue.3, pp.203-224, 2002.
DOI : 10.7155/jgaa.00052

D. Harel and Y. Koren, A Fast Multi-Scale Method for Drawing Large Graphs, Journal of Graph Algorithms and Applications, vol.6, issue.3, pp.179-2002, 2002.
DOI : 10.7155/jgaa.00051

C. Walshaw, A Multilevel Algorithm for Force-Directed Graph Drawing, Graph Drawing, pp.171-182, 2001.

J. Chuang, C. Lin, and H. Yen, Drawing Graphs with Nonuniform Nodes Using Potential Fields, Proceedings Graph Drawing, pp.460-465, 2004.
DOI : 10.1007/978-3-540-24595-7_43

Y. Frishman and A. , Dynamic Drawing of Clustered Graphs, IEEE Symposium on Information Visualization, pp.191-198, 2004.
DOI : 10.1109/INFVIS.2004.18

T. Dwyer, Y. Koren, and K. Marriott, IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. Visualization and Computer Graphics, IEEE Transactions on, vol.12, issue.5, pp.821-828, 2006.

A. Noack, An Energy Model for Visual Graph Clustering, Proceedings Graph Drawing, pp.425-436, 2004.
DOI : 10.1007/978-3-540-24595-7_40

Q. D. Truong, T. Dkaki, and P. J. , An energy model for the drawing of clustered graphs, 5th VSST, 2007.

P. Eades and M. L. Huang, Navigating Clustered Graphs Using Force- Directed Methods, J. Graph Algorithms Appl, pp.157-181, 2000.
DOI : 10.7155/jgaa.00029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.3275

M. Balzer and O. Deussen, Level-of-detail visualization of clustered graph layouts, 2007 6th International Asia-Pacific Symposium on Visualization, pp.133-140, 2007.
DOI : 10.1109/APVIS.2007.329288

P. Rodgers, Graph Drawing Techniques for Geographic Visualization, 2004.
DOI : 10.1016/B978-008044531-1/50425-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.5382

T. Dkaki, J. Mothe, and Q. D. Truong, Passage Retrieval Using Graph Vertices Comparison, 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System, 2007.
DOI : 10.1109/SITIS.2007.82
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.4031

J. Kleinberg, Authoritative sources in a hyperlinked environment, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp.668-677, 1998.
DOI : 10.1145/324133.324140

V. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van-dooren, A measure of similarity between graph vertices, p.407061, 2004.