Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t \geqslant 1 , that corresponds to Downey and Fellows's W-hierarchy [12] and show that a few central W-completeness results for decision problems translate to #W-completeness results for the corresponding counting problems.Counting complexity gets interesting with problems whose decision version is tractable, but whose counting version is hard. Our main result states that counting cycles and paths of length k in both directed and undirected graphs, parameterized by k , is#W[1]-complete. This makes it highly unlikely that any of these problems is fixed-parameter tractable, even though their decision versions are fixed-parameter tractable. More explicitly, our result shows that most likely there is no f(k) \cdot n^c-algorithm for counting cycles or paths of length k in a graph of size n for any computable function f: \mathbb{N} \to \mathbb{N} and constant c , even though there is a 2^{0(k)}\cdot n^{2.376}algorithm for finding a cycle or path of length k [2].