Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

@article{Curticapean2014ComplexityOC,
  title={Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts},
  author={Radu Curticapean and D. Marx},
  journal={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
  year={2014},
  pages={130-139}
}
  • Radu Curticapean, D. Marx
  • Published 2014
  • Mathematics, Computer Science
  • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that if C has bounded vertex-cover number (equivalently, the size of the maximum matching in C is bounded), then #Sub(C) is polynomial-time solvable. We complement this result with a corresponding lower bound: if C is any recursively enumerable class of graphs with unbounded vertexcover number, then #Sub(C) is #W[1… CONTINUE READING
    The parameterised complexity of counting connected subgraphs and graph motifs
    23
    Homomorphisms are a good basis for counting small subgraphs
    57
    Some Hard Families of Parameterized Counting Problems
    12
    The parameterised complexity of counting even and odd induced subgraphs
    11
    On Counting Parameterized Matching and Packing
    1
    Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 58 REFERENCES
    Weighted Counting of k-Matchings Is #W[1]-Hard
    12
    Counting Matchings of Size k Is W[1]-Hard
    33
    Testing first-order properties for subclasses of sparse graphs
    78
    Deciding first-order properties of nowhere dense graphs
    162
    Approximation Algorithms for Some Parameterized Counting Problems
    77
    Faster algorithms for finding and counting subgraphs
    62
    Strong computational lower bounds via parameterized complexity
    198
    Finding, minimizing, and counting weighted subgraphs
    92
    Understanding the Complexity of Induced Subgraph Isomorphisms
    45
    Counting and Detecting Small Subgraphs via Equations
    23