skip to main content
research-article

The complexity of counting homomorphisms to cactus graphs modulo 2

Published:01 August 2014Publication History
Skip Abstract Section

Abstract

A homomorphism from a graph G to a graph H is a function from V(G) to V(H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this article, we study the complexity of counting homomorphisms modulo 2. The complexity of modular counting was introduced by Papadimitriou and Zachos and it has been pioneered by Valiant who famously introduced a problem for which counting modulo 7 is easy but counting modulo 2 is intractable. Modular counting provides a rich setting in which to study the structure of homomorphism problems. In this case, the structure of the graph H has a big influence on the complexity of the problem. Thus, our approach is graph-theoretic. We give a complete solution for the class of cactus graphs, which are connected graphs in which every edge belongs to at most one cycle. Cactus graphs arise in many applications such as the modelling of wireless sensor networks and the comparison of genomes. We show that, for some cactus graphs H, counting homomorphisms to H modulo 2 can be done in polynomial time. For every other fixed cactus graph H, the problem is complete in the complexity class ⊕P, which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions). Determining which H lead to tractable problems can be done in polynomial time. Our result builds upon the work of Faben and Jerrum, who gave a dichotomy for the case in which H is a tree.

References

  1. Ben-Moshe, B., Bhattacharya, B. K., Shi, Q., and Tamir, A. 2007. Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378, 3, 237--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ben-Moshe, B., Dvir, A., Segal, M., and Tamir, A. 2012. Centdian computation in cactus graphs. J. Graph Algor. Appl. 16, 2, 199--224.Google ScholarGoogle ScholarCross RefCross Ref
  3. Bulatov, A. A. and Grohe, M. 2005. The complexity of partition functions. Theor. Comput. Sci. 348, 2--3, 148--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Cai, J.-Y., Chen, X., and Lu, P. 2010. Graph homomorphisms with complex values: a dichotomy theorem. In Proceedings of ICALP (1). 275--286. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Creignou, N. and Hermann, M. 1996. Complexity of generalized satisfiability counting problems. Inform. Comput. 125, 1, 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dyer, M. E., Goldberg, L. A., and Jerrum, M. 2009. The complexity of weighted Boolean #CSP. SIAM J. Comput. 38, 5, 1970--1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dyer, M. E. and Greenhill, C. S. 2000. The complexity of counting graph homomorphisms. Random Struct. Algor. 17, 3--4, 260--289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Faben, J. 2008. The complexity of counting solutions to generalised satisfiability problems modulo k. CoRR abs/0809.1836.Google ScholarGoogle Scholar
  9. Faben, J. 2012. The complexity of modular counting in constraint satisfaction problems. Ph.D. Dissertation, Queen Mary, University of London.Google ScholarGoogle Scholar
  10. Faben, J. and Jerrum, M. 2013. The complexity of parity graph homomorphism: an initial investigation. CoRR abs/1309.4033.Google ScholarGoogle Scholar
  11. Goldberg, L. A., Grohe, M., Jerrum, M., and Thurley, M. 2010. A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput. 39, 7, 3336--3402. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Goldschlager, L. M. and Parberry, I. 1986. On the construction of parallel computers from various bases of Boolean functions. Theor. Comput. Sci. 43, 43--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Guo, H., Huang, S., Lu, P., and Xia, M. 2011. The complexity of weighted Boolean #CSP modulo k. In Proceedings of STACS. 249--260.Google ScholarGoogle Scholar
  14. Guo, H., Lu, P., and Valiant, L. G. 2013. The complexity of symmetric Boolean parity Holant problems. SIAM J. Comput. 42, 1, 324--356.Google ScholarGoogle ScholarCross RefCross Ref
  15. Harary, F. and Uhlenbeck, G. E. 1953. On the number of Husimi trees. I. Proc. Nat. Acad. Sci. U. S. A. 39, 315--322.Google ScholarGoogle ScholarCross RefCross Ref
  16. Hell, P. and Neřetřil, J. 1990. On the complexity of H-coloring. J. Comb. Theory, Ser. B 48, 1, 92--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Jordan, C. 1869. Sur les assemblages de lignes. J. Reine Angew. Math. 70, 185--190.Google ScholarGoogle ScholarCross RefCross Ref
  18. Lovász, L. 1967. Operations with structures. Acta Math. Acad. Sci. Hungar. 18, 321--328.Google ScholarGoogle ScholarCross RefCross Ref
  19. McKay, J. H. 1959. Another proof of Cauchy’s group theorem. Amer. Math. Monthly 66, 119.Google ScholarGoogle Scholar
  20. Papadimitriou, C. H. and Zachos, S. 1982. Two remarks on the power of counting. In Proceedings of the 6th GI-Conference on Theoretical Computer Science. Springer-Verlag, 269--276. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Paten, B., Diekhans, M., Earl, D., John, J. S., Ma, J., Suh, B. B., and Haussler, D. 2011. Cactus graphs for genome comparisons. J. Comput. Biol. 18, 3, 469--481.Google ScholarGoogle ScholarCross RefCross Ref
  22. Toda, S. 1991. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 5, 865--877. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Valiant, L. G. 2006. Accidental algorithms. In Proceedings of FOCS. 509--517. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The complexity of counting homomorphisms to cactus graphs modulo 2

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!