A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Data-Compression for Parametrized Counting Problems on Sparse Graphs

2018
*
International Symposium on Algorithms and Computation
*

We study the concept of compactor, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function F : Σ * → N and a parameterization κ : Σ * → N, a compactor (P, M) consists of a polynomial-time computable function P, called condenser, and a computable function M, called extractor, such that F = M•P, and the condensing P(x) of x has length at most s(κ(x)), for any input x ∈ Σ * . If s is a polynomial function, then the compactor is said to be of

doi:10.4230/lipics.isaac.2018.20
dblp:conf/isaac/0002ST18
fatcat:xytw4ioxsbelxko3iv4tmutely