Finding a maximum weight triangle in n 3-δtime, with applications

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 225-231

  Vassilevska, Virginia ^a   Williams, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Clique; Dominating pairs; Independent set; Matrix multiplication; Sub cubic algorithm; Triangle

Indexed keywords

CLIQUE; DOMINATING PAIRS; INDEPENDENT SETS; MATRIX MULTIPLICATION; SUB-CUBIC ALGORITHMS; TRIANGLE;

COMPUTATIONAL COMPLEXITY; ECONOMICS; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMS;

EID: 33748112078     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Alon, R. Yuster, and U. Zwick. Color-Coding. JACM 42(4):844-856, 1995.
2. 3/log n) Time. In Proc. WADS, Springer-Verlag LNCS 3608, 318-324, 2005.
3. D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions. JSC 9(3):251-280, 1990.
4. D. Gale and L. S. Shapley. College admissions and the stability of marriage. Amer. Math, Monthly 69:9-15, 1962.
5. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. J. Comp. Syst. Sci. 54:243-254, 1997.
6. R. W. Floyd. Algorithm 97: Shortest path. Comm. ACM 5:345, 1962.
7. X. Huang and V. Y. Pan. Fast rectangular matrix multiplication and applications. Journal of Complexity, 14(2):257-299, 1998.
8. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7(4): 413-423, 1978.
9. L. R. Kerr. The effect of algebraic structure on the computational complexity of matrix multiplications. Ph.D. Thesis. Cornell University, Ithaca, NY, 1970.
10. n. Inf. Proc. Letters 38(5): 277-278, 1991.
11. J. Plehn and B. Voigt. Finding Minimally Weighted Subgraphs. In Proc. 16th Int. Workshop on Graph-Theoretic Concepts in Comp. Sci. (WG'90), Springer-Verlag, 1991.
12. R. Seidel. On the all-pair-shortest-path problem. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC'92), 1992.
13. A. Shoshan and U. Zwick. All Pairs Shortest Paths in Undirected Graphs with Integer Weights. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS'99), 1999.
14. V. Vassilevska, R. Williams, and R. Yuster. Finding the smallest H-subgraph in real weighted graphs and related problems. Manuscript, in preparation.
15. R. Yuster. Private communication.
16. 2.81 Infinite-Precision Multiplications. Inf. Proc. Letters 4: 155-156, 1976.
17. U. Zwick. All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication. JACM 49(3):289-317, May 2002.