Tight Bounds for Connectivity Problems Parameterized by Cutwidth

12/23/2022
by   Narek Bojikian, et al.
0

In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal and feedback vertex set. We answer it for these two and four further problems, namely connected vertex cover, connected domintaing set, steiner tree, and connected odd cycle transversal. For the latter two problems it sufficed to prove lower bounds that match the running time inherited from parameterization by treewidth; for the others we provide faster algorithms than relative to treewidth and prove matching lower bounds. For upper bounds we first extend the idea of Groenland et al. [STACS 2022] to solve what we call coloring-like problem. Such problems are defined by a symmetric matrix M over 𝔽_2 indexed by a set of colors. The goal is to count the number (modulo some prime p) of colorings of a graph such that M has a 1-entry if indexed by the colors of the end-points of any edge. We show that this problem can be solved faster if M has small rank over 𝔽_p. We apply this result to get our upper bounds for connected vertex cover and connected dominating set. The upper bounds for odd cycle transversal and feedback vertex set use a subdivision trick to get below the bounds that matrix rank would yield.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2020

Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

The Cut Count technique and the rank-based approach have lead to sin...
research
10/06/2021

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

We study the fine-grained complexity of counting the number of colorings...
research
02/27/2023

Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth

We study connectivity problems from a fine-grained parameterized perspec...
research
05/05/2018

On exploiting degeneracy to count subgraphs

Motivated by practical applications, we study the complexity of counting...
research
02/14/2022

Codes with structured Hamming distance in graph families

We investigate the maximum size of graph families on a common vertex set...
research
01/15/2020

Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...
research
07/16/2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations

Treewidth is as an important parameter that yields tractability for many...

Please sign up or login with your details

Forgot password? Click here to reset