Information Technology Reference
In-Depth Information
12. Jankun-Kelly, T.J., Dwyer, T., Holten, D., Hurter, C., Nollenburg, M., Weaver, C.,
Xu, K.: Scalability considerations for multivariate graph visualization. In: Kerren,
A., Purchase, H.C., Ward, M.O. (eds.) Multivariate Network Visualization 2013.
LNCS, vol. 8380, pp. 208-236. Springer, Heidelberg (2013)
13. Kobourov, S.G.: Force-directed drawing algorithms. In: Tamassia, R. (ed.) Handbk.
of Graph Drawing and Visualization, pp. 383-408. Chapman & Hall/CRC (2013)
14. Mantegna, R.N.: Hierarchical structure in financial markets. The European Phys-
ical Journal B-Condensed Matter and Complex Systems 11(1), 193-197 (1999)
15. McSherry, F.: Spectral partitioning of random graphs. In: FOCS, pp. 529-537.
IEEE Computer Society (2001)
16. Melancon, G., Sallaberry, A.: Edge metrics for visual graph analytics: A compar-
ative study. In: IV, pp. 610-615. IEEE Computer Society (2008)
17. Nick, B., Lee, C., Cunningham, P., Brandes, U.: Simmelian backbones: amplify-
ing hidden homophily in facebook networks. In: Rokne, J.G., Faloutsos, C. (eds.)
ASONAM, pp. 525-532. ACM (2013)
18. Pfaltz, J.L.: The irreducible spine(s) of undirected networks. In: Lin, X.,
Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013, Part II. LNCS,
vol. 8181, pp. 104-117. Springer, Heidelberg (2013)
19. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and iden-
tifying communities in networks. Proc. Natl. Acad. Sci. 101(9), 2658-2663 (2004)
20. Satuluri, V., Parthasarathy, S., Ruan, Y.: Local graph sparsification for scalable
clustering. In: Sellis, T.K., Miller, R.J., Kementsietsidis, A., Velegrakis, Y. (eds.)
SIGMOD Conference, pp. 721-732. ACM (2011)
21. Schnettler, S.: A structured overview of 50 years of small-world research. Social
Networks 31(3), 165-178 (2009)
22. Simmel, G.: The sociology of Georg Simmel, vol. 92892. Simon and Schuster (1950)
23. Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM
J. Comput. 40(6), 1913-1926 (2011)
24. Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning,
graph sparsification, and solving linear systems. In: Babai, L. (ed.) STOC, pp.
81-90. ACM (2004)
25. Subramanian, A., Wei, S.J.: The WTO promotes trade, strongly but unevenly.
Journal of International Economics 72(1), 151-175 (2007)
26. Traud, A.L., Kelsic, E.D., Mucha, P.J., Porter, M.A.: Comparing community struc-
ture to characteristics in online collegiate social networks. SIAM Review 53(3),
526-543 (2011)
27. Tumminello, M., Aste, T., Di Matteo, T., Mantegna, R.: A tool for filtering infor-
mation in complex systems. Proc. Natl. Acad. Sci. 102(30), 10421-10426 (2005)
28. Van Ham, F., Wattenberg, M.: Centrality based visualization of small world graphs.
Computer Graphics Forum 27(3), 975-982 (2008)
29. Zaidi, F., Sallaberry, A., Melancon, G.: Revealing hidden community structures
and identifying bridges in complex networks: An application to analyzing contents
of web pages for browsing. In: Web Intelligence, pp. 198-205. IEEE (2009)
30. Zhou, F., Mahler, S., Toivonen, H.: Network simplification with minimal loss of
connectivity. In: Webb, G.I., Liu, B., Zhang, C., Gunopulos, D., Wu, X. (eds.)
ICDM, pp. 659-668. IEEE Computer Society (2010)
