Searching for "Parameterized counting problems." – sorted by Relevance.
-
The parameterized complexity of counting problems
- The parameterized complexity of counting problems Jörg Flum ∗ Martin Grohe † January 22, 2004
- Cited by 14 (0 self) – Add To MetaCart
-
Efficient algorithms for counting parameterized list H-Colorings
- to design fixed parameter algorithms for parameterized counting problems. Key words: restrictive H
- Add To MetaCart
-
Fixed parameter algorithms for counting and deciding bounded restrictive list H-colorings
- theory for the intractability of parameterized counting problems (see for example [10, 14]). However, so
- Add To MetaCart
-
Contributions to Parameterized Complexity
- in which one may consider parameterized counting problems, extending the framework developed by Downey
- Cited by 4 (3 self) – Add To MetaCart
-
Recent results on Parameterized H-Coloring
- the counting problem is in P. The aim of this paper is to survey the use of ideas from parameterized
- Cited by 4 (3 self) – Add To MetaCart

