Skip to Main content Skip to Navigation
Conference papers

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Abstract : 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 polynomial-size. Although the study on counting-analogue of kernelization is not unprecedented, it has received little attention so far. We study a family of vertex-certified counting problems on graphs that are MSOL-expressible; that is, for an MSOL-formula φ with one free set variable to be interpreted as a vertex subset, we want to count all A ⊆ V (G) where |A| = k and (G, A) |= φ. In this paper, we prove that every vertex-certified counting problems on graphs that is MSOL-expressible and treewidth modulable, when parameterized by k, admits a polynomial-size compactor on H-topological-minor-free graphs with condensing time O(k 2 n 2) and decoding time 2 O(k). This implies the existence of an FPT-algorithm of running time O(n 2 k 2) + 2 O(k). All aforementioned complexities are under the Uniform Cost Measure (UCM) model where numbers can be stored in constant space and arithmetic operations can be done in constant time.
Complete list of metadata

Cited literature [45 references]  Display  Hide  Download
Contributor : Dimitrios Thilikos Connect in order to contact the contributor
Submitted on : Friday, November 1, 2019 - 12:48:47 PM
Last modification on : Friday, August 5, 2022 - 3:02:53 PM
Long-term archiving on: : Sunday, February 2, 2020 - 2:12:12 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos. Data-Compression for Parametrized Counting Problems on Sparse Graphs. 29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩. ⟨lirmm-02342803⟩



Record views


Files downloads