Counting subgraphs via homomorphisms

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 71-82

  Amini, Omid ^a   Fomin, Fedor V ^b   Saurabh, Saket ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; CHROMATIC POLYNOMIALS; CLASSICAL ALGORITHMS; COLOR CODING; COMBINATORICS; EXTREMAL GRAPH THEORY; GENERIC APPROACH; GRAPH HOMOMORPHISMS; GRAPH PRODUCT; HAMILTONIAN CYCLE; LARGE GRAPHS; NEW APPLICATIONS; PARAMETERIZED ALGORITHM; PARTITION FUNCTIONS; PERFECT MATCHINGS; PROPERTY-TESTING; STATISTICAL PHYSICS; SUBGRAPHS;

GRAPH THEORY; HAMILTONIANS; LINGUISTICS; TRANSLATION (LANGUAGES);

ALGORITHMS;

EID: 70449113255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_8     Document Type: Conference Paper

References (29)

1. Alon, N., Yuster, R., Zwick, U: Color-coding. J. ACM 42, 844-856 (1995)
2. Babai, L.: Moderately exponential bound for graph isomorphism. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 34-50. Springer, Heidelberg (1981)
3. Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: FOCS, pp. 162-171 (1983)
4. Bax, E.T.: Algorithms to count paths and cycles. Inform. Process. Lett. 52, 249-252 (1994)
5. Beals, R., Chang, R., Gasarch, W.I., Torán, J.: On finding the number of graph automorphisms. Chicago J. Theor. Comput. Sci. (1999)
6. Bernardi, O., Noy, M., Welsh, D.: On the growth rate of minor-closed classes of graphs, http://arxiv.org/abs/0710.2995
7. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226-249 (2008)
8. Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: FOCS, pp. 575-582 (2006)
9. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: STOC, pp. 67-74 (2007)
10. Blankenship, R., Oporowski, B.: Book embeddings of graphs and minor-closed classes. In: Proceedings of the 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing
11. Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Counting graph homomorphisms. In: Topics in discrete mathematics. Algorithms Combin., vol. 26, pp. 315-371. Springer, Berlin (2006)
12. Cygan, M., Pilipczuk, M.: Faster exact bandwidth. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 101-109. Springer, Heidelberg (2008)
13. Dalmau, V., Jonsson, P.: The complexity of counting homomorphisms seen from the other side. Theoret. Comput. Sci. 329, 315-323 (2004)
14. Díaz, J., Serna, M.J., Thilikos, D.M.: Counting h-colorings of partial k-trees. Theor. Comput. Sci. 281, 291-309 (2002)
15. Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. Random Structures Algorithms 17, 260-289 (2000)
16. Feige, U.: Coping with the NP-Hardness of the Graph Bandwidth Problem. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 10-19. Springer, Heidelberg (2000)
17. Feige, U., Hajiaghayi, M.T., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: STOC, pp. 563-572 (2005)
18. Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54, Art. 1, 24 (electronic) (2007)
19. Hell, P., Nešetřil, J.: On the complexity of H-coloring. J. Combin. Theory Ser. B 48, 92-110 (1990)
20. Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford Lecture Series in Mathematics and its Applications, vol. 28. Oxford University Press, Oxford (2004)
21. Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1, 49-51 (1982)
22. Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the annual ACM conference, pp. 294-300 (1977)
23. n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: FOCS, pp. 583-590 (2006)
24. Lovász, L.: Operations with structures. Acta Math. Hung. 18, 321-328 (1967)
25. Malitz, S.M.: Genus g graphs have pagenumber O(√ g). J. Algorithms 17, 85-109 (1994)
26. Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: FOCS, pp. 182-191 (1995)
27. Norine, S., Seymour, P.D., Thomas, R., Wollan, P.: Proper minor-closed families are small. J. Comb. Theory, Ser. B 96, 754-757 (2006)
28. Ryser, H.J.: Combinatorial mathematics. The Carus Mathematical Monographs, vol. 14. The Mathematical Association of America (1963)
29. Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201 (1979)