DeepAI AI Chat
Log In Sign Up

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure

01/31/2022
by   Hans L. Bodlaender, et al.
ENS Paris-Saclay
Utrecht University
0

In this paper, we show several parameterized problems to be complete for the class XNLP: parameterized problems that can be solved with a non-deterministic algorithm that uses f(k)log n space and f(k)n^c time, with f a computable function, n the input size, k the parameter and c a constant. The problems include Maximum Regular Induced Subgraph and Max Cut parameterized by linear clique-width, Capacitated (Red-Blue) Dominating Set parameterized by pathwidth, Odd Cycle Transversal parameterized by a new parameter we call logarithmic linear clique-width (defined as k/log n for an n-vertex graph of linear clique-width k), and Bipartite Bandwidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/31/2021

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Let XNLP be the class of parameterized problems such that an instance of...
12/09/2021

A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More

In the past a few years, many interesting inapproximability results have...
06/23/2022

On the Complexity of Problems on Tree-structured Graphs

In this paper, we introduce a new class of parameterized problems, which...
05/04/2023

On the parameterized complexity of the Perfect Phylogeny problem

This paper categorizes the parameterized complexity of the algorithmic p...
04/30/2018

Fundamentals of Parameterized Complexity Revisited

What is a parameterized algorithm? What is a parameterized problem and w...
05/29/2018

Rank Based Approach on Graphs with Structured Neighborhood

In this paper, we combine the rank-based approach and the neighbor-equiv...
10/02/2017

Target Set Selection Parameterized by Clique-Width and Maximum Threshold

The Target Set Selection problem takes as an input a graph G and a non-n...