Abstract
We consider parameterized subgraph counting problems of the following form: given a graph G, how many k-tuples of its vertices induce a subgraph with a given property? A number of such problems are known to be #W[1]-complete; here, we substantially generalize some of these existing results by proving hardness for two large families of such problems. We demonstrate that it is #W[1]-hard to count the number of k-vertex subgraphs having any property where the number of distinct edge densities of labeled subgraphs that satisfy the property is o(k2). In the special case in which the property in question depends only on the number of edges in the subgraph, we give a strengthening of this result, which leads to our second family of hard problems.
- V. Arvind and V. Raman. 2002. Approximation algorithms for some parameterized counting problems. In ISAAC 2002 (LNCS), P. Bose and P. Morin (Eds.), Vol. 2518. Springer-Verlag, Berlin, 453--464. Google Scholar
Digital Library
- Y. Chen and J. Flum. 2007. On parameterized path and chordless path problems. In 22nd Annual IEEE Conference on Computational Complexity (CCC’07). 250--263. Google Scholar
Digital Library
- Y. Chen, M. Thurley, and M. Weyer. 2008. Understanding the complexity of induced subgraph isomorphisms. In Automata, Languages and Programming (Lecture Notes in Computer Science), L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz (Eds.), Vol. 5125. Springer, Berlin, 587--596. DOI:http://dx.doi.org/10.1007/978-3-540-70575-8_48 Google Scholar
Digital Library
- R. Curticapean. 2013. Counting matchings of size k is #W{1}-hard. In Automata, Languages, and Programming (Lecture Notes in Computer Science), F. V. Fomin, R. Freivalds, M. Kwiatkowska, and D. Peleg (Eds.), Vol. 7965. Springer, Berlin, 352--363. Google Scholar
Digital Library
- R. Curticapean and D. Marx. 2014. Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts. In 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS’14). Google Scholar
Digital Library
- V. Dalmau and P. Jonsson. 2004. The complexity of counting homomorphisms seen from the other side. Theoretical Computer Science 329, 1--3 (2004), 315--323. Google Scholar
Digital Library
- P. Erdős and G. Szekeres. 1935. A combinatorial problem in geometry. Compositio Mathematics 2 (1935), 464--470.Google Scholar
- M. Fellows, D. Hermelin, F. Rosamond, and S. Vialette. 2009. On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science 410 (2009), 53--61. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2004. The parameterized complexity of counting problems. SIAM Journal of Computing 33, 4 (2004), 892--922. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer. Google Scholar
Digital Library
- M. Jerrum and K. Meeks. 2015. The parameterised complexity of counting connected subgraphs and graph motifs. Journal of Computer and System Sciences 81, 4 (2015), 702--716. DOI:http://dx.doi.org/10.1016/j.jcss.2014.11.015Google Scholar
Cross Ref
Index Terms
Some Hard Families of Parameterized Counting Problems
Recommendations
The Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W$[t]$, for $t\ge 1$, that corresponds to Downey and Fellows's W-hierarchy [R. G. ...
Parameterized complexity of connected even/odd subgraph problems
In 2011, Cai an Yang initiated the systematic parameterized complexity study of the following set of problems around Eulerian graphs: for a given graph G and integer k, the task is to decide if G contains a (connected) subgraph with k vertices (edges) ...
Parameterized coloring problems on chordal graphs
Parameterized and exact computationIn the precoloring extension problem (PREXT) a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two ...






Comments