Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

This is the authors' abstract. We don't add key points for this paper.

For the General Factor problem we are given an undirected graph G and for each vertex v∈ V(G) a finite set Bᵥ of non-negative integers. The task is to decide if there is a subset S⊆ E(G) such that degS(v)∈ Bᵥ for all vertices v of G. The maxgap of a finite integer set B is the largest d≥ 0 such that there is an a≥ 0 with [a,a+d+1]∩ B=,a+d+1\. Cornuéjols (1988) showed that if the maxgap of all sets Bᵥ is at most 1, then the decision version of General Factor is poly-time solvable. Dudycz and Paluch (2018) extended this result for the minimization and maximization versions. Using convolution techniques from van Rooij (2020), we improve upon the previous algorithm by Arulselvan et al. (2018) and present an algorithm counting the number of solutions of a certain size in time O^*((M+1)ᵏ), given a tree decomposition of width k, where M=maxᵥ max Bᵥ. We prove that this algorithm is essentially optimal for all cases that are not polynomial time solvable for the decision, minimization or maximization versions. We prove that such improvements are not possible even for B-Factor, which is General Factor on graphs where all sets Bᵥ agree with the fixed set B. We show that for every fixed B where the problem is NP-hard, our new algorithm cannot be significantly improved: assuming the Strong Exponential Time Hypothesis (SETH), no algorithm can solve B-Factor in time O^*((max B+1-ε)ᵏ) for any $ε>0$. We extend this bound to the counting version of B-Factor for arbitrary, non-trivial sets B, assuming #SETH. We also investigate the parameterization of the problem by cutwidth. Unlike for treewidth, a larger set B does not make the problem harder: Given a linear layout of width k we give a O^*(2ᵏ) algorithm for any B and provide a matching lower bound that this is optimal for the NP-hard cases.