The complexity of counting homomorphisms to cactus graphs modulo 2
Authors:
Open Access
- 1 August 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computation Theory
- Vol. 6 (4) , 1-29
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.Keywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/1011528/1)
- Seventh Framework Programme
- European Research Council (334828)
This publication has 17 references indexed in Scilit:
- Cactus Graphs for Genome ComparisonsJournal of Computational Biology, 2011
- A Complexity Dichotomy for Partition Functions with Mixed SignsSIAM Journal on Computing, 2010
- The Complexity of Weighted Boolean #CSPSIAM Journal on Computing, 2009
- Efficient algorithms for center problems in cactus networksTheoretical Computer Science, 2007
- The complexity of partition functionsTheoretical Computer Science, 2005
- Complexity of Generalized Satisfiability Counting ProblemsInformation and Computation, 1996
- PP is as Hard as the Polynomial-Time HierarchySIAM Journal on Computing, 1991
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Another Proof of Cauchy's Group TheoremThe American Mathematical Monthly, 1959
- Sur les assemblages de lignes.Journal für die reine und angewandte Mathematik (Crelles Journal), 1869