Minimum weight cycles and triangles: Equivalences and algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 180-189

  Roditty, Liam ^a   Williams, Virginia Vassilevska ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

equivalence; girth; minimum cycle; reduction matrix multiplication; triangle

Indexed keywords

EQUIVALENCE; GIRTH; MATRIX MULTIPLICATION; MINIMUM CYCLE; TRIANGLE;

COMPUTER SCIENCE; DIRECTED GRAPHS; MANGANESE; MANGANESE COMPOUNDS; SEPARATION;

ALGORITHMS;

EID: 84863321000     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.27     Document Type: Conference Paper

References (22)

1. N. Alon, Z. Galil, and O. Margalit, "On the exponent of the all pairs shortest path problem," J. Comput. Syst. Sci., vol. 54, no. 2, pp. 255-262, 1997. (Pubitemid 127433373)
2. N. Alon, R. Yuster, and U. Zwick, "Color-coding," JACM, vol. 42, no. 4, pp. 844-856, 1995.
3. E. Arkin and C. H. Papadimitriou, "On negative cycles in mixed graphs," Operations Research Letters, vol. 4, no. 3, pp. 113-116, 1985.
4. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," J. Symbolic Computation, vol. 9, no. 3, pp. 251-280, 1990.
5. D. Dor, S. Halperin, and U. Zwick, "All-pairs almost shortest paths," SIAM J. Comput., vol. 29, no. 5, pp. 1740-1759, 2000.
6. R. W. Floyd, "Algorithm 97: shortest path," Comm. ACM, vol. 5, p. 345, 1962.
7. M. Fredman, J. Komlós, and E. Szemerédi, "Storing a sparse table with O(1) worst case access time," JACM, vol. 31, pp. 538-544, 1984. (Pubitemid 15563701)
8. Z. Galil and O. Margalit, "All pairs shortest paths for graphs with small integer length edges," JCSS, vol. 54, pp. 243-254, 1997. (Pubitemid 127433372)
9. A. Goldberg, "Scaling algorithms for the shortest paths problem," in Proc. SODA, 1993, pp. 222-231.
10. A. Itai and M. Rodeh, "Finding a minimum circuit in a graph," SIAM J. Computing, vol. 7, no. 4, pp. 413-423, 1978.
11. A. Lingas and E.-M. Lundell, "Efficient approximation algorithms for shortest cycles in undirected graphs," Inf. Process. Lett., vol. 109, no. 10, pp. 493-498, 2009.
12. S. Pettie, "A new approach to all-pairs shortest paths on real-weighted graphs," Theor. Comput. Sci., vol. 312, no. 1, pp. 47-74, 2004.
13. L. Roditty and R. Tov, "Approximating the girth," in Proc. SODA, 2011, pp. 1446-1454.
14. L. Roditty and V. V. Williams, "Minimum weight cycles and triangles: Equivalences and algorithms," CoRR, vol. abs/1104.2882, 2011.
15. J. Schmidt and A. Siegel, "The spatial complexity of oblivious k-probe hash functions," SIAM J. Comput., vol. 19, no. 5, pp. 775-786, 1990.
16. R. Seidel, "On the all-pairs-shortest-path problem in unweighted undirected graphs," JCSS, vol. 51, pp. 400-403, 1995.
17. A. Shoshan and U. Zwick, "All pairs shortest paths in undirected graphs with integer weights," in Proc. FOCS, 1999, pp. 605-614.
18. S. Warshall, "A theorem on Boolean matrices," J. ACM, vol. 9, no. 1, pp. 11-12, 1962.
19. V. V. Williams and R. Williams, "Subcubic equivalences between path, matrix and triangle problems," in Proc. FOCS, 2010, pp. 645-654.
20. R. Yuster and U. Zwick, "Answering distance queries in directed graphs using fast matrix multiplication," in Proc. FOCS, 2005, pp. 389-396.
21. G. Yuval, "An algorithm for finding all shortest paths using N2:81 infinite-precision multiplications," Inf. Proc. Letters, vol. 4, pp. 155-156, 1976.
22. U. Zwick, "All pairs shortest paths using bridging sets and rectangular matrix multiplication," JACM, vol. 49, no. 3, pp. 289-317, 2002.