Determinant sums for undirected hamiltonicity

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

Volumn , Issue , 2010, Pages 173-182

  Björklund, Andreas ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; GRAPH ALGORITHMS; HAMILTONIANS; NP-HARD;

BIPARTITE GRAPHS; CYCLE COVERS; EXACT ALGORITHMS; FINITE FIELDS; HAMILTONICITY; MONTE CARLO ALGORITHMS; TECHNICAL CONTRIBUTION; UNDIRECTED GRAPH;

GRAPH THEORY;

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

References (24)

1. N. Alon, R. Yuster, and U. Zwick. Color coding. Journal of the ACM (JACM) Volume 42, Issue 4, pp. 844-856, 1995.
2. E. T. Bax. Inclusion and Exclusion algorithm for the Hamiltonian Path problem. Inf. Process. Lett. 47(4), pp. 203-207, 1993.
3. R. Bellman. Combinatorial processes and dynamic programming, Combinatorial Analysis (R. Bellman, M. Hall. Eds.), Proceedings of Symposia in Applied Mathematics 10, American Mathematical Society, pp. 217-249, 1960.
4. R. Bellman. Dynamic programming treatment of the travelling salesman problem, J. Assoc. Comput. Mach. 9, pp. 61-63, 1962.
5. A. Björklund. Exact Covers via Determinants. Proceedings of 27th STACS, pp. 95-106, 2010.
6. A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto. Fourier meets Möbius: Fast Subset Convolution. Proceedings of the 39th STOC, pp. 67-74, 2007.
7. A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto. The traveling salesman problem in bounded degree graphs. Proceedings of the 35th ICALP, pp. 198-209, 2008.
8. H. Broersma, F. V. Fomin, P. van t Hof, and D. Paulusma. Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs, Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 44-53, 2009.
9. J. R. Bunch and J. E. Hopcroft. Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, 28: 231-236, 1974.
10. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
11. M. Held and R. M. Karp. A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math. 10, pp. 196-210, 1962.
12. D. Eppstein. The traveling salesman problem for cubic graphs. J. Graph Algorithms Appl. 11, pp. 61-81, 2007.
13. H. Gebauer. On the number of Hamilton cycles in bounded degree graphs, Proceedings of the Fourth Workshop on Analytic Algorithms and Combinatorics, ANALCO 2008. SIAM, 2008.
14. R. Impagliazzo, R. Paturi, and F. Zane. Which Problems Have Strongly Exponential Complexity? Journal of Computer and System Sciences 63, pp. 512-530, 2001.
15. K. Iwama and T. Nakashima. An Improved Exact Algorithm for Cubic Graph TSP. COCOON: pp. 108-117, 2007.
16. R. M. Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations. New York: Plenum. pp. 85-103, 1972.
17. R. M. Karp. Dynamic programming meets the principle of inclusion and exclusion, Oper. Res. Lett. 1 no. 2, pp. 49-51, 1982.
18. S. Kohn, A. Gottlieb, and M. Kohn. A generating function approach to the traveling salesman problem, Proceedings of the 1977 Annual Conference (ACM'77), Association for Computing Machinery, pp. 294-300, 1977.
19. I. Koutis. Faster Algebraic Algorithms for Path and Packing Problems. 35th ICALP, pp. 575-586, 2008.
20. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
21. k) Time. Inform. Process. Lett. 109(6) pp. 315-318, 2009.
22. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink! M. Juenger, G. Reinelt and G. Rinaldi (eds.). LNCS 2570, Springer, pp 185-207, 2003.
23. F. Yates, The Design and Analysis of Factorial Experiments, Technical Communication No. 35, Commonwealth Bureau of Soil Science, Harpenden, UK, 1937.
24. 2.81 infinite-precision multiplications, Inform. Process. Lett. 4 pp. 155-156, 1976.