Finding paths of length k in O* (2k) time

Information Processing Letters

Volumn 109, Issue 6, 2009, Pages 315-318

  Williams, Ryan ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Graph algorithms; Group algebra; Parameterized algorithms; Randomized algorithms

Indexed keywords

ALGEBRA;

FINDING PATHS; GRAPH ALGORITHMS; GROUP ALGEBRA; PARAMETERIZED ALGORITHMS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 58549118058     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.11.004     Document Type: Article

References (15)

1. Alon N., Yuster R., and Zwick U. Color-coding. J. ACM 42 4 (1995) 844-856
2. Applegate D.L., Bixby R.E., Chvátal V., and Cook W.J. The Traveling Salesman Problem: A Computational Study (2007), Princeton University Press
3. Bellman R. Dynamic programming treatment of the travelling salesman problem. J. ACM 9 1 (1962) 61-63
4. Blum M., and Kannan S. Designing programs that check their work. J. ACM 42 1 (1995) 269-291
5. J. Chen, S. Lu, S.-H. Sze, F. Zhang, Improved algorithms for path, matching, and packing problems, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, pp. 298-307
6. Held M., and Karp R.M. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10 1 (1962) 196-210
7. Impagliazzo R., and Kabanets V. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13 1-2 (2004) 1-46
8. Karp R.M. Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters 1 2 (1982) 49-51
9. Kneis J., Mölle D., Richter S., and Rossmanith P. Divide-and-color. Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG). LNCS vol. 4271 (2006), Springer 58-67
10. Koutis I. Faster algebraic algorithms for path and packing problems. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). LNCS vol. 5125 (2008), Springer 575-586
11. D.K. Maslen, D.N. Rockmore, Generalized FFTs - a survey of some recent results, in: Proceedings of the DIMACS Workshop on Groups and Computation, 1995
12. Monien B. How to find long paths efficiently. Annals of Discrete Mathematics 25 (1985) 239-254
13. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
14. Scott J., Ideker T., Karp R.M., and Sharan R. Efficient algorithms for detecting signaling pathways in protein interaction networks. Journal of Computational Biology 13 2 (2006) 133-144
15. Shoup V. Fast construction of irreducible polynomials over finite fields. Journal of Symbolic Computation 17 5 (1994) 371-391