Finding a heaviest triangle is not harder than matrix multiplication

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 986-994

  Czumaj, Artur ^a   Lingas, Andrzej ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA;

ASYMPTOTIC TIME COMPLEXITY; FIXED GRAPHS; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM; RUNNING TIME; SPARSE GRAPHS; UNDIRECTED GRAPH; UPPER BOUND;

GRAPH THEORY;

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

References (13)

1. N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42: 844-856, 1995.
2. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Grouptheoretic algorithms for matrix multiplication. Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS'05), pp. 379-388, 2005.
3. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Symbolic Computation, 13: 42-49, 1997.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9: 251-290, 1990.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. 2nd edition, McGraw-Hill Book Company, Boston, MA, 2001.
6. A. Czumaj and A. Lingas. Improved algorithms for the allpairs lowest common ancestor problem in directed acyclic graphs. Manuscript, July 2005.
7. A. Czumaj, M. Kowaluk, and A. Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. To appear in Theoretical Computer Science, special issue devoted to selected papers from the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05). This paper is a result of merging [6] and [11].
8. R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics 51(1):161-166, January 1950.
9. X. Huang and V. Y. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14: 257-299, 1998.
10. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7(4): 413-423, 1978.
11. M. Kowaluk and A. Lingas. LCA queries in directed acyclic graphs. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pp. 241-248, 2005.
12. 3-δtime, with applications. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06), pp. 225-231, 2006.
13. V. Vassilevska, R. Williams, R. Yuster. Finding the smallest H-subgraph in real weighted graphs and related problems. Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), pp. 262-273, 2006.