Triangle sparsifiers

Journal of Graph Algorithms and Applications

Volumn 15, Issue 6, 2011, Pages 703-726

  Tsourakakis, Charalampos E ^a   Kolountzakis, Mihail N ^b   Miller, Gary L ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF CRETE   (Greece)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84866780092     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00245     Document Type: Article

References (62)

1. Alon, N., Yossi, M., Szegedy, M.: The space complexity of approximating the frequency moments. ACM Symposium on Theory of Computing (1996)
2. Alon, N., Yuster, R., Zwick, U.: Finding and Counting Given Length Cycles. Algorithmica, Volume 17, Number 3, 209-223 (1997)
3. Alon, N., Kaufman, T., Krilevich, M., Ron, D.: Testing triangle-freeness in general graphs Proceedings of the seventeenth annual ACM-SIAM sympo-sium on Discrete algorithm (SODA), pp. 279-288 (2006)
4. Avron, H.: Counting triangles in large graphs using randomized matrix trace estimation. Workshop on Large-scale Data Mining: Theory and Applications (2010)
5. Bar-Yehuda, R. and Even, S.: On approximating a vertex cover for planar graphs. Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 303-309 (1982)
6. Bar-Yosseff, Z., Kumar, R., Sivakumar, D.: Reductions in streaming al- gorithms, with an application to counting triangles in graphs. ACM-SIAM Symposium on Discrete Algorithms (2010)
7. Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2008)
8. Benczúr, A., Karger, D.: Approximating -t Minimum Cuts in Otilde;(2) Time ACM Symposium on Theory of Computing, pp. 47-55 (1998)
9. Benczúr, A., Karger, D.: Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. Arxiv Preprint, available at http://arxiv.org/abs/cs.DS/0207078 (2002)
10. Berry, J.W., Hendrickson, B., LaViolette, R., Phillips, C.A.: Tolerating the Community Detection Resolution Limit with Edge Weighting. Arxiv Preprint, available at http://arxiv.org/abs/0903.1072
11. Bhamidi, S., Bresler, G., Sly, A.: Mixing Time of Exponential Random Graphs., Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 803-812, (2008)
12. Bollobás, B.: Modern Graph Theory Springer Verlag (1998)
13. Bonato, A., Hadi, N, Horn, P., Pralat, P., Wang, C.: Models of Online Social Networks. Internet Mathematics, Vol. 6(3), 285-313, (2009)
14. Broder, A.Z., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise inde- pendent permutations. ACM Symposium on Theory of Computing (1998)
15. Buriol, L., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting Triangles in Data Streams. Symposium on Principles of Database Systems (2006)
16. Chiba, N., Nishizeki, T.: Arboricity and Subgraph Listing Algorithms. SIAM Journal on Computing, Vol. 14(1), pp. 210-223 (1985)
17. Chung Graham, F., Lu, L., Vu, V.: The Spectra of Random Graphs with Given Expected Degrees. Internet Mathematics, Vol.1(3) (2003)
18. Coppersmith D., Winograd S.: Matrix multiplication via arithmetic pro- gressions. ACM Symposium on Theory of Computing (1987)
19. Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in Large Graphs and Matrices ACM Symposium on Discrete Algorithms (1999)
20. Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Proceedings of the National Academy of Sciences (2002)
21. Frank, O., Strauss, D.: Markov Graphs. Journal of the American Statistical Association, Vol. 81(395), pp. 832-842 (1986)
22. Foster, R.M.: The Average Impedance of an Electrical Network. Contri- butions to Applied Mechanics (Reissner Anniversary Volume), pp. 333-340 (1949)
23. Fudos, I., Hoffman, C.: A Graph-Constructive Approach to Solving Systems of Geometric Constraints ACM Trans. Graph., Vol. 16, pp. 179-216 (1997)
24. Heider, F.: Attitudes and Cognitive Organization Journal of Psychology, Vol. 21, 107-112 (1946)
25. Imrich, W., Klavzar, S., Mulder, H.M.: Median Graphs and Triangle-Free Graphs SIAM Journal on Discrete Mathematics,12(1) pp. 111-118 (1999)
26. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. ACM Sympo- sium on Theory of Computing (1977)
27. Jerrum, M., Valiant, L., Vazirani, V.: Random generation of combinatorial structures from a uniform distribution Theoretical Computer Science, Vol. 43, pp.169-188 (1986)
28. Jowhari, H., Ghodsi, M.: New Streaming Algorithms for Counting Trian- gles in Graphs. Computing and Combinatorics (2005)
29. Kim, J.H., Vu, V.H: Concentration of multivariate polynomials and its ap- plications. Combinatorica, Vol. 20(3), pp. 417-434 (2000)
30. Kim, J. H., Vu, V. H.: Divide and conquer martingales and the number of triangles in a random graph. Journal of Random Structures and Algorithms, 24(2), pp. 166-174 (2004)
31. Kolountzakis, M.N., Miller, G.L., Peng, R., Tsourakakis, C.E.: Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. 7th Workshop on Algorithms and Models for the Web Graph, (2010)
32. Koutis, I., Miller, G.L., Peng, R.: Solving SDD linear systems in time Õ (mlognlog1/). Arxiv Preprint, available at http://arxiv.org/abs/1102.4842
33. Knuth, D.: Seminumerical Algorithms Addison-Wesley Professional; 3 edi- tion (1997)
34. Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science, 407, pp. 458-473 (2008)
35. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and nega- tive links in online social networks. International conference on World wide web, pp. 641-650 (2010)
36. Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolu- tion of social networks. ACM SIGKDD international conference on Knowl- edge discovery and data mining, pp. 462-470 (2008)
37. Li, S., Armstrong, C.M., Bertin, N., Ge H., Miltein, S., Boxem, M., Vi-dalain, P.O, Han, J.D., Chesneau, A., Hao, T., Goldberg, D., Li, N., Mar-tinez, M., Rual, J.F., Lamesch, P., Xu, Lai, Tewari, M., Wong, S., Zhang, L., Berriz, G., Jacotot, L., Vaglio, P., Reboul, J., Hirozane-Kishikawa, T., Li, Q., Gabel, H., Elewa, A., Baumgartner, B., Rose, D., Yu, H., Bosak, S., Sequerra, R., Fraser, A., Mango, S., Saxton, W., Strome, S., Van Den Heuvel, S., Piano, F., Vandenhaute, J., Sardet, C., Gerstein, M., Doucette- Stamm, L., Gunsalus, K., Harper, J., Cusick, M., Roth, F., Hill D., Vidal, M.: A map of the interactome network of the metazoan C. elegans. Science, Vol. 303, pp/ 540-543 (2004)
38. Mislove, A., Massimiliano, M., Gummadi, K., Druschel, P., Bhattacharjee, B.: Measurement and Analysis of Online Social Networks. Internet Mea-surement Conference (2007)
39. Newman, M. E. J. and Watts, D. J. and Strogatz, S.: Random graph models of social networks. Proceedings of the National Academy of Sciences of the United States of America, Vol. 99, pp. 2566-2572 (2002)
40. Pagh, C., Tsourakakis, C.E.: Colorful Triangle Counting and a MapRe- duce Implementation. Arxiv Preprint, available at http://arxiv.org/abs/1103.6073
41. Papadimitriou, C., Yannakakis, M.: The clique problem for planar graphs. Information Processing Letters, 13, 131-133 (1981).
42. Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to expo- nential random graph (p*) models for social networks. Social Networks Jour-nal, Special Section: Advances in Exponential Random Graph (p*) Models, Vol. 29, pp. 173-191 (2007)
43. Rougemont, J. and Hingamp, P: DNA microarray data and contextual anal- ysis of correlation graphs. BMC Bioinformatics, Vol. 4 (2003)
44. Schank, T., Wagner, D.: Finding, Counting and Listing all Triangles in Large Graphs, An Experimental Study. Workshop on Experimental and Ef- ficient Algorithms (2005)
45. Schank, T., Wagner, D.: Approximating Clustering Coefficient and Tran- sitivity. Journal of Graph Algorithms and Applications, Vol. 9, pp. 265-275 (2005)
46. Spielman, D., Srivastava, N.: Graph Sparsification by Effective Resistances. Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 563-568 (2008)
47. Spielman, D., Teng, S.H.: Spectral Sparsification of Graphs. Arxiv Preprint, available at http://arxiv.org/abs/0808.4134
48. Spinrad, J.P.: Efficient graph representations Fields Institute Monographs, 19, 2003
49. Tao, T., Vu, V.H.: Additive Combinatorics. Cambridge Studies in Ad- vanced Mathematics (2006)
50. Tsourakakis, C.E.: Fast Counting of Triangles in Large Real Networks, without counting: Algorithms and Laws. International Conference on Data Mining (2008)
51. Tsourakakis, C.E.: Counting Triangles Using Projections. Knowledge and Information Systems (2011)
52. Tsourakakis, C.E., Kang, U, Miller, G.L., Faloutsos, C.: Doulion: Counting Triangles in Massive Graphs with a Coin. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2009)
53. Tsourakakis, C.E., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral Counting of Triangles via Element-Wise Sparsification and Triangle-Based Link Recommendation. Advances in Social Networks Analy- sis and Mining (2010)
54. V.H. Vu, On the concentration of multivariate polynomials with small ex- pectation. Random Structures and Algorithms, Vol. 16, pp. 344-363 (2000)
55. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Appli- cations (Structural Analysis in the Social Sciences). Cambridge University Press (1994)
56. Wasserman, S., Pattison, P.: Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p*. Psychometrika, Vol. 61, pp. 401-425 (1996)
57. Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Na- ture, Vol. 393, pp. 440-442 (1998)
58. Wesler, H., Gleave, E., Fisher, D., Smith, M.: Visualizing the Signatures of Social Roles in Online Discussion Groups. The Journal of Social Structure, Vol. 8, (2007)
59. Wimmer, A., Lewis, K.: Beyond and Below Racial Homophily: ERG Mod- els of a Friendship Network Documented on Facebook. American Journal of Sociology, Vol. 2, pp. 583-642 (2010)
60. Vassilevska Williams, V., Williams, R.: Subcubic Equivalences between Path, Matrix and Triangle Problems Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 645-654 (2010)
61. Wimmer, A., Lewis, K.: Beyond and Below Racial Homophily: ERG Mod- els of a Friendship Network Documented on Facebook. American Journal of Sociology, Vol. 2, pp. 583-642 (2010)
62. Yook, S., Oltvai, Z., Barabasi, A.L.: Functional and topological charac- terization of protein interaction networks. Proteomics, Vol. 4, pp. 928-942 (2004)