A. L. Baraba?i and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

M. Chimani, C. Gutwenger, M. Jünger, G. W. Klau, K. Klein et al., The open graph drawing framework (OGDF), Handbook on Graph Drawing and Visualization, pp.543-569, 2013.

T. Dwyer, K. Marriott, and P. J. Stuckey, Fast node overlap removal, International Symposium on Graph Drawing, pp.153-164, 2005.

P. Erdös and A. Rényi, On random graphs, Publicationes Mathematicae Debrecen, vol.6, pp.290-291, 1959.

E. Gansner and Y. Hu, Efficient, proximity-preserving node overlap removal, Journal of Graph Algorithms and Applications, vol.14, issue.1, pp.53-74, 2010.

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering. Software: practice and experience, vol.30, pp.1203-1233, 2000.

S. Hachul and M. Jünger, Drawing large graphs with a potential-field-based multilevel algorithm, Graph Drawing, pp.285-295, 2005.

K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara, A layout adjustment problem for disjoint rectangles preserving orthogonal order, Graph Drawing, pp.183-197, 1998.

Y. Hu, Efficient, high-quality force-directed graph drawing, Mathematica Journal, vol.10, issue.1, pp.37-71, 2005.

X. Huang and W. Lai, Force-transfer: a new approach to removing overlapping nodes in graph layout, Proceedings of the 26th Australasian, vol.16, pp.349-358, 2003.

X. Huang, W. Lai, A. Sajeev, and J. Gao, A new algorithm for removing node overlapping in graph visualization, Information Sciences, vol.177, issue.14, pp.2821-2844, 2007.

W. Li, P. Eades, and N. Nikolov, Using spring algorithms to remove node overlapping, Proceedings of the 2005 Asia-Pacific Symposium on Information Visualisation, vol.45, pp.131-140, 2005.

K. A. Lyons, H. Meijer, and D. Rappaport, Algorithms for cluster busting in anchored graph drawing, Journal of Graph Algorithms and Applications, vol.2, issue.1, pp.1-24, 1998.

K. Marriott, P. Stuckey, V. Tam, and W. He, Removing node overlapping in graph layout using constrained optimization, Constraints, vol.8, issue.2, pp.143-171, 2003.

K. Misue, P. Eades, W. Lai, and K. Sugiyama, Layout adjustment and the mental map, Journal of Visual Languages & Computing, vol.6, issue.2, pp.183-210, 1995.

L. Nachmanson, A. Nocaj, S. Bereg, L. Zhang, and A. Holroyd, Node overlap removal by growing a tree, International Symposium on Graph Drawing and Network Visualization, pp.33-43, 2016.

H. Strobelt, M. Spicker, A. Stoffel, D. Keim, and O. Deussen, Rolled-out wordles: A heuristic method for overlap removal of 2d data representatives, Computer Graphics Forum, vol.31, issue.3, pp.1135-1144, 2012.

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, pp.440-442, 1998.