The challenges of unbounded treewidth in parameterised subgraph counting problems

Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of these subgraphs in some sense; here, we prove a number of hardness results for the situation in which this bounded treewidth condition does not hold, resulting in dichotomies for some special cases of the general subgraph counting problem. The paper also gives a thorough survey of known results on this subject and the methods used, as well as discussing the relationships both between multicolour and uncoloured versions of subgraph counting problems, and between exact counting, approximate counting and the corresponding decision problems.

[1]  Dániel Marx,et al.  Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[2]  Omid Amini,et al.  Counting Subgraphs via Homomorphisms , 2009, SIAM J. Discret. Math..

[3]  Peter Jonsson,et al.  Bounded Tree-Width and CSP-Related Problems , 2007, ISAAC.

[4]  Christian Komusiewicz,et al.  Parameterized Algorithmics for Finding Connected Motifs in Biological Networks , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  Charalampos E. Tsourakakis.  Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[6]  Mark Jerrum,et al.  Some Hard Families of Parameterized Counting Problems , 2013, ACM Trans. Comput. Theory.

[7]  Boaz Gelbord,et al.  Graphical techniques in intrusion detection systems , 2001, Proceedings 15th International Conference on Information Networking.

[8]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[10]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[11]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms , 2000, Random Struct. Algorithms.

[12]  Bingkai Lin,et al.  The Parameterized Complexity of k-Biclique , 2014, SODA.

[13]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.

[14]  B. V. Raghavendra Rao,et al.  Parameterized Analogues of Probabilistic Computation , 2014, CALDAM.

[15]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[16]  Andreas Björklund,et al.  Counting Paths and Packings in Halves , 2009, ESA.

[17]  David A. Maltz,et al.  Toward a Framework for Internet Forensic Analysis , 2004 .

[18]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[19]  Peter van Emde Boas,et al.  On tape versus core an application of space efficient perfect hash functions to the invariance of space , 1984, STOC '84.

[20]  Mark Jerrum,et al.  The parameterised complexity of counting connected subgraphs and graph motifs , 2013, J. Comput. Syst. Sci..

[21]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[22]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[23]  Martin Grohe,et al.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[24]  Noga Alon,et al.  Color-coding , 1995, JACM.

[25]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[26]  Luca Becchetti,et al.  Efficient semi-streaming algorithms for local triangle counting in massive graphs , 2008, KDD.

[27]  Jeanette P. Schmidt,et al.  The Spatial Complexity of Oblivious k-Probe Hash Functions , 2018, SIAM J. Comput..

[28]  Mark Jerrum,et al.  The parameterised complexity of counting even and odd induced subgraphs , 2014, Comb..

[29]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[30]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[31]  Dorothea Wagner,et al.  Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study , 2005, WEA.

[32]  Mihail N. Kolountzakis,et al.  Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning , 2010, Internet Math..

[33]  Pinar Heggernes,et al.  Graph-Theoretic Concepts in Computer Science , 2016, Lecture Notes in Computer Science.

[34]  Markus Bläser,et al.  Weighted Counting of k-Matchings Is #W[1]-Hard , 2012, IPEC.

[35]  L FredmanMichael,et al.  Storing a Sparse Table with 0(1) Worst Case Access Time , 1984 .

[36]  Peng Zhang,et al.  Computational complexity of counting problems on 3-regular planar graphs , 2007, Theor. Comput. Sci..

[37]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[38]  Yijia Chen,et al.  Understanding the Complexity of Induced Subgraph Isomorphisms , 2008, ICALP.

[39]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[40]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[41]  Michael R. Fellows,et al.  Parameterized Circuit Complexity and the W Hierarchy , 1998, Theor. Comput. Sci..

[42]  Mihail N. Kolountzakis,et al.  Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning , 2012, Internet Math..

[43]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[44]  Noga Alon,et al.  Balanced families of perfect hash functions and their applications , 2007, TALG.

[45]  Moritz Müller,et al.  Parameterized Random Complexity , 2013, Theory of Computing Systems.

[46]  Sylvain Guillemot,et al.  Finding and Counting Vertex-Colored Subtrees , 2010, Algorithmica.

[47]  Noga Alon,et al.  Balanced Hashing, Color Coding and Approximate Counting , 2009, IWPEC.

[48]  Bernd Voigt,et al.  Finding Minimally Weighted Subgraphs , 1991, WG.

[49]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.

[50]  Peter Jonsson,et al.  The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..

[51]  Catherine S. Greenhill,et al.  The complexity of counting graph homomorphisms , 2000 .

[52]  Steven Skiena,et al.  Recognizing small subgraphs , 1995, Networks.

[53]  Radu Curticapean,et al.  Counting Matchings of Size k Is W[1]-Hard , 2013, ICALP.

[54]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[55]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[56]  Karl N. Levitt,et al.  GrIDS A Graph-Based Intrusion Detection System for Large Networks , 1996 .

[57]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..