Parameterized Counting Problems

  • Catherine McCartin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2420)


Parameterized complexity has, so far, been largely confined to consideration of computational problems as decision or search problems. However, it is becoming evident that the parameterized point of view can lead to new insight into counting problems. The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems.


Turing Machine Vertex Cover Boolean Expression Satisfying Assignment Perfect Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Andrzejak: An algorithm for the Tutte Polynomials of Graphs of Bounded Treewidth. Discrete Math. 190, pp 39–54, (1998).Google Scholar
  2. 2.
    V. Arvind and V. Raman: Approximate Counting Small Subgraphs of Bounded Treewidth and Related Problems. manuscript.Google Scholar
  3. 3.
    C. Bazgan: Schémas d’approximation et complexité paramétrée. Rapport de stage de DEA d’Informatique à Orsay, (1995).Google Scholar
  4. 4.
    M. Cesati: Perfect Code is W[1]-complete. Information Processing Letters 81(3), pp 163–168, (2002).zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    M. Cesati and L. Trevisan: On the Efficiency of Polynomial Time Approximation Schemes. Information Processing Letters 64(4), pp 165–171, (1997).MathSciNetCrossRefGoogle Scholar
  6. 6.
    J. Chen, I.A. Kanj and W. Jia: Vertex Cover: Further Observations and Further Improvements. Journal of Algorithms 41, pp 280–301, (2001).zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    B. Courcelle, J.A. Makowsky and U. Rotics: On the Fixed Parameter Complexity of Graph Enumeration Problems Definable in Monadic Second Order Logic. Discrete Applied mathematics, Vol. 108, No. 1-2, pp. 23–52, (2001).zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    R. G. Downey and M. R. Fellows: Fixed-parameter tractability and completeness. Congressus Numeratium, Vol 87, pp 161–187, (1992).MathSciNetGoogle Scholar
  9. 9.
    R. G. Downey and M. R. Fellows: Parameterized Complexity. Springer-Verlag (1999).Google Scholar
  10. 10.
    Markus Frick Easy Instances for Model-Checking. Ph.D. Thesis, Laboratory for Foundations of Computer Science, The University of Edinburgh, (2001).Google Scholar
  11. 11.
    Markus Frick and Martin Grohe: Deciding First-Order Properties of Locally Tree-Decomposable Graphs. Proceedings of the 26th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 1644, pp 331–340, Springer-Verlag, (1999).CrossRefGoogle Scholar
  12. 12.
    M. Grohe: personal communication.Google Scholar
  13. 13.
    D. Kozen: The Design and Analysis of Algorithms. Springer-Verlag (1991).Google Scholar
  14. 14.
    J.A. Makowsky: Colored Tutte Polynomials and Kauffman Brackets for Graphs of Bounded Tree Width. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, pp. 487–495, (2001).Google Scholar
  15. 15.
    S.D. Noble: Evaluating the Tutte Polynomial for graphs of bounded tree-width. Combin. Probab. Comput. 7, pp 307–321, (1998).zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    C. H. Papdimitriou: Computational Complexity. Addison Wesley (1994).Google Scholar
  17. 17.
    A. Razborov and M. Alekhnovich: Resolution is Not Automatizable Unless W[P] is Tractable. Proc. of the 42nd IEEE FOCS, pp 210–219, (2001).Google Scholar
  18. 18.
    L. Valiant: The complexity of computing the permanent. Theoret. Comput. Sci., Vol 8, pp 189–201, (1979).zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    D. Welsh and A. Gale: The Complexity of Counting Problems. Aspects of Complexity, editors R. Downey and D. Hirschfeldt, de Gruyter Series in Logic and Its Applications, pp 115–154, (2001).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Catherine McCartin
    • 1
  1. 1.School of Mathematical and Computing SciencesVictoria UniversityWellingtonNew Zealand

Personalised recommendations