A Fixed-Parameter Perspective on #BIS

Authors Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas

Thumbnail PDF


  • Filesize: 0.57 MB
  • 13 pages

Document Identifiers

Author Details

Radu Curticapean
Holger Dell
Fedor V. Fomin
Leslie Ann Goldberg
John Lapinskas

Cite AsGet BibTex

Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, and John Lapinskas. A Fixed-Parameter Perspective on #BIS. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class #RHPi_1. It is believed that #BIS does not have an efficient approximation algorithm but also that it is not NP-hard. We study the robustness of the intermediate complexity of #BIS by considering variants of the problem parameterised by the size of the independent set. We map the complexity landscape for three problems, with respect to exact computation and approximation and with respect to conventional and parameterised complexity. The three problems are counting independent sets of a given size, counting independent sets with a given number of vertices in one vertex class and counting maximum independent sets amongst those with a given number of vertices in one vertex class. Among other things, we show that all of these problems are NP-hard to approximate within any polynomial ratio. (This is surprising because the corresponding problems without the size parameter are complete in #RHPi_1, and hence are not believed to be NP-hard.) We also show that the first problem is #W[1]-hard to solve exactly but admits an FPTRAS, whereas the other two are W[1]-hard to approximate even within any polynomial ratio. Finally, we show that, when restricted to graphs of bounded degree, all three problems have efficient exact fixed-parameter algorithms.
  • Approximate counting
  • parameterised complexity
  • independent sets


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. V. Arvind and V. Raman. Approximation Algorithms for Some Parameterized Counting Problems, pages 453-464. Springer Berlin Heidelberg, Berlin, Heidelberg, 2002. Google Scholar
  2. Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, and Eric Vigoda. #bis-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci., 82(5):690-711, 2016. URL: http://dx.doi.org/10.1016/j.jcss.2015.11.009.
  3. R. Curticapean, H. Dell, and D. Marx. Homomorphisms are a good basis for counting small subgraphs. In Proc. STOC 2017, pages 210-213, 2017. Google Scholar
  4. M. Cygan, F. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized Algorithms. Springer, Berlin Heidelberg, 2015. Google Scholar
  5. R. G. Downey and M. R. Fellows. Fundamentals of Parameterized Complexity. Springer Publishing Company, Incorporated, 2013. Google Scholar
  6. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, and Mark Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38(3):471-500, 2004. URL: http://dx.doi.org/10.1007/s00453-003-1073-y.
  7. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM J. Comput., 33(4):892-922, 2004. Google Scholar
  8. J. Flum and M. Grohe. Parameterized complexity theory. Springer-Verlag, Berlin Heidelberg, 2006. Google Scholar
  9. M. Frick. Generalized model-checking over locally tree-decomposable classes. Theory of Computing Systems, 37(1):157-191, 2004. Google Scholar
  10. Andreas Galanis, Daniel Stefankovic, Eric Vigoda, and Linji Yang. Ferromagnetic potts model: Refined #bis-hardness and related results. SIAM J. Comput., 45(6):2004-2065, 2016. URL: http://dx.doi.org/10.1137/140997580.
  11. L. A. Goldberg and M. Jerrum. A complexity classification of spin systems with an external field. Proceedings of the National Academy of Sciences, 112(43):13161-13166, 2015. Google Scholar
  12. R. Impagliazzo and R. Paturi. On the complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367-375, 2001. Google Scholar
  13. S. Janson, T. Łuczak, and A. Rucinski. Random Graphs. John Wiley &Sons, Inc., 2000. Google Scholar
  14. Jingcheng Liu and Pinyan Lu. FPTAS for #bis with degree bounds on one side. In Rocco A. Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 549-556. ACM, 2015. URL: http://dx.doi.org/10.1145/2746539.2746598.
  15. László Lovász. Large Networks and Graph Limits, volume 60 of Colloquium Publications. American Mathematical Society, 2012. URL: http://www.ams.org/bookstore-getitem/item=COLL-60.
  16. M. Müller. Randomized approximations of parameterized counting problems. In Proc. IWPEC 2006, pages 50-59, Berlin, Heidelberg, 2006. Springer-Verlag. Google Scholar
  17. Viresh Patel and Guus Regts. Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. CoRR, abs/1607.01167, 2016. URL: http://arxiv.org/abs/1607.01167.
  18. M. Sipser. Introduction to the Theory of Computation. International Thomson Publishing, 1st edition, 1996. Google Scholar
  19. M. Xia, P. Zhang, and W. Zhao. Computational complexity of counting problems on 3-regular planar graphs. Theoretical Computer Science, 384(1):111-125, 2007. Google Scholar