1. Barabaśi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
2. Chimani, M., Gutwenger, C., Jünger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 543–569. Chapman and Hall/CRC, London (2013)
3. Lecture Notes in Computer Science;T Dwyer,2006
4. Erdös, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–291 (1959)
5. Gansner, E., Hu, Y.: Efficient, proximity-preserving node overlap removal. J. Graph Algorithms Appl. 14(1), 53–74 (2010)