Author:
Teimourpour Babak,Asgharpour Bahram
Publisher
Springer International Publishing
Reference17 articles.
1. Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications (1sted.). Cambridge, New York: Cambridge University Press.
2. Chonbodeechalermroong, A., & Hewett, R. (2017). Towards visualizing big data with large-scale edge constraint graph drawing. Big Data Research, 10(Supplement C), 21–32.
3. Herman, I., Melançon, G., & Marshall, M. S. (2000). Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1), 24–43.
4. Garey, M., & Johnson, D. (1983). Crossing number is NP-complete. SIAM Journal on Algebraic Discrete Methods, 4(3), 312–316.
5. Masuda, S., Kashiwabara, T., Nakajima, K., & Fujisawa, K. On the NP-completeness of a computer network layout problem [Online]. Retrieved October 13, 2017, from https://www.researchgate.net/publication/247043450_On_the_NP-completeness_of_a_computer_ network_layout_problem .