Finding, minimizing, and counting weighted subgraphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 455-463

  Vassilevska, Virginia ^a   Williams, Ryan ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

3SUM; Cliques; Paths; Subgraph isomorphism; Weighted graph

Indexed keywords

3SUM; CLIQUES; PATHS; SUBGRAPH ISOMORPHISM; WEIGHTED GRAPH;

ALGORITHMS; COMPUTATION THEORY; PARALLEL PROCESSING SYSTEMS; SET THEORY;

GRAPH THEORY;

EID: 70350689911     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536477     Document Type: Conference Paper

References (43)

1. N. Alon, P. Dao, I. Hajirasouliha, F. Hormozdiari, and S. C. Sahinalp. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24(13):241-249, 2008.
2. N. Alon and S. Gutner. Balanced families of perfect hash functions and their applications. In Proc. ICALP, pages 435-446, 2007.
3. N. Alon and M. Naor. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
4. N. Alon, R. Yuster, and U. Zwick. Color-coding. JACM, 42(4):844-856, 1995.
5. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997.
6. V. Arvind and V. Raman. Approximation algorithms for some parameterized counting problems. In Proc. ISAAC, pages 453-464, 2002.
7. I. Baran, E. Demaine, and M. Patrascu. Subquadratic algorithms for 3SUM. Algorithmica, 50(4):584-596, 2008.
8. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proc. ACM SIGKDD, pages 16-24, 2008.
9. A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto. Fourier meets Möbius: fast subset convolution. In Proc. STOC, pages 67-74, 2007.
10. A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto. The fast intersection transform with applications to counting paths. CoRR, abs/0809.2489, 2008.
11. A. K. Chandra, M. L. Furst, and R. J. Lipton. Multi-party protocols. In Proc. STOC, pages 94-99, 1983.
12. S. S. Chen, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagl, K. Levitt, C. Wee, R. Yip, and D. Zerkle. GrIDS - a graph based intrusion detection system for large networks. In Proc. 19th National Information Systems Security Conference, pages 361-371, 1996.
13. N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:210-223, 1985.
14. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9(3):251-280, 1990.
15. N. Courtois, A. Klimov, J. Patarin, and A. Shamir. Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In Proc. EUROCRYPT, pages 392-407, 2000.
16. A. Czumaj and A. Lingas. Finding a heaviest triangle is not harder than matrix multiplication. In Proc. SODA, pages 986-994, 2007.
17. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proc. STACS, pages 569-580, 1996.
18. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM J. Comput., 33(4):892-922, 2004.
19. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
20. M. L. Fredman. On the decision tree complexity of the shortest path problems. In Proc. FOCS, pages 98-99, 1975.
21. A. Gajentaan and M. Overmars. On a class of O(n2) problems in computational geometry. Computational Geometry, 5(3):165-185, 1995.
22. B. Gelbord. Graphical techniques in intrusion detection systems. In Proc. 15th International Conference on Information Networks, pages 253-238, 2001.
23. Y. Gurevich and S. Shelah. Expected computation time for hamiltonian path problem. SIAM J. Comput., 16(3):486-502, 1987.
24. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7(4):413-423, 1978.
25. T. Kawabata and J. Tarui. On complexity of computing the permanent of a rectangular matrix. IECIE Trans. on Fundamentals of Electronics, 82(5):741-744, 1999.
26. A. Kipnis and A. Shamir. Cryptanalysis of the HFE public key cryptosystem by relinearization. In Proc. CRYPTO, volume 1666, pages 19-30, 1999.
27. T. Kloks, D. Kratsch, and H. Müller. Finding and counting small induced subgraphs efficiently. Inf. Proc. Letters, 74(3-4):115-121, 2000.
28. S. Landau. Polynomials in the nation's service: using algebra to design the advanced encryption standard. American Mathematical Monthly, 111:89-117, 2004.
29. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: simple building blocks of complex networks. Science, 298(5594):824-827, 2002.
30. H. Minc. Permanents. Cambridge University Press, New York, NY, USA, 1984.
31. J. Neetril and S. Poljak. On the complexity of the subgraph problem. Commentationes Math. Universitatis Carolinae, 26(2):415-419, 1985.
32. J. Patarin. Cryptoanalysis of the matsumoto and imai public key scheme of eurocrypt'88. In Proc. Annual Cryptology Conference (CRYPTO), pages 248-261, 1995.
33. M. Patrascu. Personal communication.
34. F. Romani. Shortest-path problem is not harder than matrix multiplication. Information Processing Letters, 11:134-136, 1980.
35. H. Ryser. Combinatorial mathematics. Wiley & Math. Assoc. Amer., 1963.
36. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Experimental and Efficient Algorithms, pages 606-609, 2008.
37. V. Sekar, Y. Xie, D. A. Maltz, M. K. Reiter, and H. Zhang. Toward a framework for internet forensic analysis. In Third Workshop on Hot Topics in Networking (HotNets-III), 2004.
38. G. Sundaram and S. S. Skiena. Recognizing small subgraphs. Networks, 25:183-191, 1995.
39. C. E. Tsourakakis. Fast counting of triangles in large real networks, without counting: Algorithms and laws. In Proc. IEEE ICDM, volume 14, 2008.
40. V. Vassilevska and R. Williams. Finding a maximum weight triangle in n3-δ time, with applications. In Proc. STOC, pages 225-231, 2006.
41. V. Vassilevska, R. Williams, and R. Yuster. Finding the smallest H-subgraph in real weighted graphs and related problems. In Proc. ICALP, volume 4051, pages 262-273, 2006.
42. R. Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci., 348(2-3):357-365, 2005.
43. 2:81 infinite-precision multiplications. Inf. Proc. Letters, 4:155-156, 1976.