Approximating the girth

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1446-1454

  Roditty, Liam ^a   Tov, Roei ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPHIC METHODS;

ALL PAIRS SHORTEST PATHS; APPROXIMATED SOLUTIONS; APPROXIMATION FACTOR; BOOLEAN MATRICES; COMBINATORIAL ALGORITHM; REAL EDGE WEIGHTS; SUBCUBIC ALGORITHMS; WEIGHTED UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 79955727144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.112     Document Type: Conference Paper

References (15)

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. L. Althofer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
3. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
4. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997. (Pubitemid 127440916)
5. 2 polylog n) time. In V. Diekert and B. Durand, editors, STAGS, volume 3404 of Lecture Notes in Computer Science, pages 666- 679. Springer, 2005. (Pubitemid 41241286)
6. S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In FOGS, pages 591-602. IEEE Computer Society, 2006.
7. E. Cohen and U. Zwick. All-pairs small-stretch paths. J. Algorithms, 38(2):335-353, 2001. (Pubitemid 33668341)
8. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM J. Comput., 29(5):1740- 1759, 2000. (Pubitemid 32021664)
9. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Comput., 7(4):413-423, 1978.
10. A. Lingas and E. M. Lundell. Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett., 109(10):493-498, 2009.
11. D. Feleg and A.A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
12. L. Roditty and U. Zwick. On dynamic shortest paths problems. In Proc. of 12th ESA, pages 580-591, 2004.
13. V. V. Williams and R. Williams. Subcubic equivalences between path, matrix, and triangle problems. In FOGS, 2010.
14. R. Yuster and U. Zwick. Finding even cycles even faster. In S. Abiteboul and E. Shamir, editors, ICALP, volume 820 of Lecture Notes in Computer Science, pages 532-543. Springer, 1994.
15. R. Yuster and U. Zwick. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In J. I. Munro, editor, SODA, pages 254-260. SIAM, 2004.