Parameterized counting problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 556-567

  McCartin, Catherine ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL PROBLEM; COUNTING PROBLEMS; FORMAL FRAMEWORK; PARAMETERIZED; PARAMETERIZED COMPLEXITY; SEARCH PROBLEM;

PARAMETERIZATION;

EID: 35048862266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_46     Document Type: Conference Paper

References (19)

1. A. Andrzejak: An algorithm for the Tutte Polynomials of Graphs of Bounded Treewidth. Discrete Math. 190, pp 39-54, (1998).
2. V. Arvind and V. Raman: Approximate Counting Small Subgraphs of Bounded Treewidth and Related Problems. manuscript.
3. C. Bazgan: Schémas d’approximation et complexité paramétrée. Rapport de stage de DEA d’Informatique à Orsay, (1995).
4. M. Cesati: Perfect Code is W[1]-complete. Information Processing Letters 81(3), pp 163-168, (2002).
5. M. Cesati and L. Trevisan: On the Efficiency of Polynomial Time Approximation Schemes. Information Processing Letters 64(4), pp 165-171, (1997).
6. J. Chen, I.A. Kanj and W. Jia: Vertex Cover: Further Observations and Further Improvements. Journal of Algorithms 41, pp 280-301, (2001).
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).
8. R. G. Downey and M. R. Fellows: Fixed-parameter tractability and completeness. Congressus Numeratium, Vol 87, pp 161-187, (1992).
9. R. G. Downey and M. R. Fellows: Parameterized Complexity. Springer-Verlag (1999).
10. Markus Frick Easy Instances for Model-Checking. Ph.D. Thesis, Laboratory for Foundations of Computer Science, The University of Edinburgh, (2001).
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).
12. M. Grohe: personal communication.
13. D. Kozen: The Design and Analysis of Algorithms. Springer-Verlag (1991).
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).
15. S.D. Noble: Evaluating the Tutte Polynomial for graphs of bounded tree-width. Combin. Probab. Comput. 7, pp 307-321, (1998).
16. C. H. Papdimitriou: Computational Complexity. Addison Wesley (1994).
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).
18. L. Valiant: The complexity of computing the permanent. Theoret. Comput. Sci., Vol 8, pp 189-201, (1979).
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).