Counting paths and packings in halves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5757 LNCS, Issue , 2009, Pages 578-586

  Björklund, Andreas ^a   Husfeldt, Thore ^a,b   Kaski, Petteri ^c   Koivisto, Mikko ^c  

^a LUND UNIVERSITY   (Sweden)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

^c UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC OPERATION; CARTESIAN PRODUCTS; N-VERTEX GRAPH; POLYNOMIAL SPACE;

SET THEORY;

EID: 70350761404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_52     Document Type: Conference Paper

References (27)

1. Alon, N., Gutner, S.: Balanced hashing, color coding and approximate counting. Electronic Colloquium on Computational Complexity, Report TR09-12 (2009)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42, 844-856 (1995)
3. Bellman, R.: Combinatorial processes and dynamic programming. In: Bellman, R., Hall Jr., M. (eds.) Combinatorial Analysis. Proceedings of Symposia in Applied Mathematics 10, pp. 217-249. American Mathematical Society (1960)
4. Bellman, R.: Dynamic programming treatment of the travelling Salesman Problem. J. Assoc. Comput. Mach. 9, 61-63 (1962)
5. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. (to appear) Special Issue for FOCS 2006
6. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: 39th ACM Symposium on Theory of Computing (STOC 2007), pp. 67-74. ACM Press, New York (2007)
7. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius inversion and graphs of bounded degree. In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). Dagstuhl Seminar Proceedings 08001, pp. 85-96. IBFI Schloss Dagstuhl (2008)
8. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The fast intersection transform with applications to counting paths. CoRR, abs/0809.2489 (2008)
9. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), Philadelphia, PA, USA, pp. 298-307. Society for Industrial and Applied Mathematics (2007)
10. Danzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
11. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)
12. Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput. 33, 892-922 (2004)
13. Gurevich, Y., Shelah, S.: Expected computation time for Hamiltonian path problem. SIAM J. Comput.16, 486-502 (1987)
14. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math.̃10, 196-210 (1962)
15. Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack Problem. J. Assoc. Comput. Mach.̃21, 277-292 (1974)
16. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Algorithms 50, 106-117 (2004)
17. Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1, 49-51 (1982)
18. Kennes, R.: Computational aspects of the Moebius transform on a graph. IEEE Transactions on System, Man, and Cybernetics 22, 201-223 (1991)
19. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 58-67. Springer, Heidelberg (2006)
20. Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: ACM Annual Conference (ACM 1977), pp. 294-300. ACM Press, New York (1977)
21. Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94, 4-7 (2005)
22. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575-586. Springer, Heidelberg (2008)
23. Koutis, I., Williams, R.: Limitations and applications of group algebras for parameterized problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part I. LNCS, vol. 5555, pp. 653-664. Springer, Heidelberg (2009)
24. Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. J. Comput. Syst. Sci. 53, 161-170 (1996)
25. Pohl, I.: Bi-directional and heuristic search in path problems. PhD thesis, Report SLAC-104, Stanford University (1969)
26. Vassilevska, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. In: 41st ACM Symposium on Theory of Computing (STOC 2009), pp. 455-464 (2009)
27. k) time. Information Processing Letters 109, 315-318 (2009)