Parameterized counting algorithms for general graph covering problems

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 99-109

  Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION THEORY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

COMPACTOR TECHNIQUES; EDGE DOMINATING SETS; PARAMETRIZED COMPLEXITY; PARAMETRIZED DECISION PROBLEMS;

ALGORITHMS;

EID: 26844532527     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_10     Document Type: Conference Paper

References (6)

1. [AR02] V. Arvind and V. Raman. Approximation algorithms for some parameterized counting problems. In Electronic Colloquium on Computational Complexity, 2002.
2. [Dam04] P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In Proc., 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004), pages 1-12, 2004.
3. [DST04a] J. Díaz, M. Serna, and D. M. Thilikos. Fixed parameter algorithms for counting and deciding bounded restrictive list h-colorings. In Proc., 12th Annual European Symposium on Algorithms (ESA 2004), pages 275-286, 2004.
4. [DST04b] J. Díaz, M. Serna, and D. M. Thilikos. Recent results on parameterized h-coloring. In Jarik Nesetril and P. Winkler (eds.) DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, Morphisms and Statistical Physics, volume 63, pages 65-86. Amer. Math. Soc., Providence, RI, 2004.
5. [Fer02] H. Fernau. On parameterized enumeration. In Proc., 8th Annual International Conference on Computing and Combinatorics (COCOON 2002), pages 564-573, 2002.
6. [FG04] J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM J. Comput., 33(4):892-922 (electronic), 2004.