Subquadratic time approximation algorithms for the girth

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 833-845

  Roditty, Liam ^a   Vassilevska Williams, Virginia ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; DIRECTED GRAPHS; GEOMETRY; GRAPHIC METHODS;

DETERMINISTIC ALGORITHMS; EFFICIENT APPROXIMATION ALGORITHMS; EVEN CYCLES; MULTIPLICATIVE APPROXIMATIONS; STRONG SEPARATIONS; TIME ALGORITHMS; TRIANGLE-FREE GRAPHS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84860212942     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.67     Document Type: Conference Paper

References (23)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput., 28(4):1167-1181, 1999.
2. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
3. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997. (Pubitemid 127440916)
4. V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev. On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl., 11:1209-1210, 1970.
5. N. Bansal and R. Williams. Regularity lemmas and combinatorial algorithms. In Proc. FOCS, pages 745-754, 2009.
6. S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In Proc. FOCS, pages 591-602, 2006.
7. A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, 16:97-105, 1974.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9(3):251-280, 1990.
9. A. Czumaj, M. Kowaluk, and A. Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci., 380(1-2):37-46, 2007. (Pubitemid 46754592)
10. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM J. Comput., 29(5):1740-1759, 2000. (Pubitemid 32021664)
11. M. J. Fischer and A. R. Meyer. Boolean matrix multiplication and transitive closure. In Proc. FOCS, pages 129-131, 1971.
12. M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31:538-544, 1984.
13. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7(4):413-423, 1978.
14. T. Kavitha, C. Liebchen, K. Mehlhorn, D. Michail, R. Rizzi, T. Ueckerdt, and K. A. Zweig. Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review, 3(4):199-243, 2009.
15. M. Krivelevich, Z. Nutov, and R. Yuster. Approximation algorithms for cycle packing problems. In Proc. SODA, pages 556-561, 2005.
16. A. Lingas and E-M. Lundell. Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett., 109(10):493-498, 2009.
17. L. Roditty and R. Tov. Approximating the girth. In Proc. SODA, pages 1446-1454, 2011.
18. L. Roditty and V. Vassilevska Williams. Minimum weight cycles and triangles: Equivalences and algorithms. In Proc. FOCS, 2011.
19. J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput., 19(5):775-786, 1990.
20. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. STOC, pages 183-192, 2001.
21. L. G. Valiant. General context-free recognition in less than cubic time. Journal of Computer and System Sciences, 10:308-315, 1975.
22. V. Vassilevska Williams and R. Williams. Subcubic equivalences between path, matrix and triangle problems. In Proc. FOCS, pages 645-654, 2010.
23. R. Yuster and U. Zwick. Finding even cycles even faster. In Proc. ICALP, pages 532-543, 1994.