Visualization of large networks with min-cut plots, A-plots and R-MAT

Albert, 2000, Topology of complex networks: local events and universality, Physical Review Letters, 85, 10.1103/PhysRevLett.85.5234 Albert, 2002, Statistical mechanics of complex networks, Reviews of Modern Physics, 74, 47, 10.1103/RevModPhys.74.47 Barabási, 2002 Berry, 1992, Large scale singular value computations, International Journal of Supercomputer Applications, 6, 13, 10.1177/109434209200600103 Bi, Z., Faloutsos, C., Korn, F., 2001. The DGX distribution for mining massive, skewed data. In: KDD. Blandford, D., Blelloch, G.E., Kash, I., 2003. Compact representations of separable graphs. In: SODA. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J., 2000. Graph structure in the web: experiments and models. In: WWW. Bu, T., Towsley, D., 2002. On distinguishing between Internet power law topology generators. In: INFOCOM. Chakrabarti, 2002 Chen, 2003, Coplink connect: information and knowledge management for law enforcement, Communications of the ACM, 46, 28, 10.1145/602421.602441 Dzeroski, S., Lavrac, N. (Eds.), 2001. Relational Data Mining. Springer, Berlin. Faloutsos, M., Faloutsos, P., Faloutsos, C., 1999. On power-law relationships of the Internet topology. In: SIGCOMM. pp. 251–262. Gibson, D., Kleinberg, J., Raghavan, P., 1998. Inferring web communities from link topology. In: ACM Conference on Hypertext and Hypermedia. Gkantsidis, C., Mihail, M., Zegura, E., 2003. Spectral analysis of Internet topologies. In: INFOCOM. Google Programming Contest, 2002. 〈http://www.google.com/programming-contest/〉. Karypis, G., Kumar, V., 1995. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report. TR 95-035. 〈www-users.cs.umn.edu/~karypis/publications/partitioning%.html〉 Kleinberg, J., Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A., 1999. The web as a graph: measurements, models and methods. In: International Conference on Combinatorics and Computing. Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A., 1999. Extracting large-scale knowledge bases from the web. In: VLDB, Edinburgh, Scotland. Medina, A., Matta, I., Byers, J., 2000. On the origin of power laws in Internet topologies. In: SIGCOMM. Montgomery, 2001, Identifying Web browsing trends and patterns, IEEE Computer, 34, 10.1109/2.933515 Newman, 2003, The structure and function of complex networks, SIAM Review, 45, 167, 10.1137/S003614450342480 Palmer, C.R., Steffan, J.G., 2000. Generating network topologies that obey power laws. In: GLOBECOM, November. Palmer, C.R., Gibbons, P.B., Faloutsos, C., 2002. ANF: a fast and scalable tool for data mining in massive graphs. In: SIGKDD, Edmonton, AB, Canada. Pastor-Satorras, 2001, Epidemic spreading in scale-free networks, Physical Review Letters, 86, 10.1103/PhysRevLett.86.3200 Pennock, 2002, Winners don’t take all: characterizing the competition for links on the Web, Proceedings of the National Academy of Sciences, 99, 5207, 10.1073/pnas.032085699 Richardson, M., Domingos, P., 2002. Mining knowledge-sharing sites for viral marketing. In: SIGKDD, Edmonton, Canada, pp. 61–70. Rosenberg, 2001 Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W., 2001. Network topologies, power laws, and hierarchy. Technical Report 01-746, U. Southern California. Tauro, S.L., Palmer, C., Siganos, G., Faloutsos, M., 2001. A simple conceptual model for the Internet topology. In: Global Internet, San Antonio, Texas. Zhan, Y., 2003. Tools for graph mining. Master's Thesis, Carnegie Mellon University.