On the Parameterized Complexity of Relaxations of Clique

03/18/2023
by   Ambroise Baril, et al.
0

We investigate the parameterized complexity of several problems formalizing cluster identification in graphs. In other words we ask whether a graph contains a large enough and sufficiently connected subgraph. We study here three relaxations of CLIQUE: s-CLUB and s-CLIQUE, in which the relaxation is focused on the distances in respectively the cluster and the original graph, and γ-COMPLETE SUBGRAPH in which the relaxation is made on the minimal degree in the cluster. As these three problems are known to be NP-hard, we study here their parameterized complexities. We prove that s-CLUB and s-CLIQUE are NP-hard even restricted to graphs of degeneracy ≤ 3 whenever s ≥ 3, and to graphs of degeneracy ≤ 2 whenever s ≥ 5, which is a strictly stronger result than its W[1]-hardness parameterized by the degeneracy. We also obtain that these problems are solvable in polynomial time on graphs of degeneracy 1. Concerning γ-COMPLETE SUBGRAPH, we prove that it is W[1]-hard parameterized by both the degeneracy, which implies the W[1]-hardness parameterized by the number of vertices in the γ-complete-subgraph, and the number of elements outside the γ-complete subgraph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

On the Clique-Width of Unigraphs

Clique-width is a well-studied graph parameter. For graphs of bounded cl...
research
07/12/2020

Recognizing k-Clique Extendible Orderings

A graph is k-clique-extendible if there is an ordering of the vertices s...
research
06/30/2021

Grid Recognition: Classical and Parameterized Computational Perspectives

Grid graphs, and, more generally, k× r grid graphs, form one of the most...
research
05/07/2020

Imbalance Parameterized by Twin Cover Revisited

We study the problem of Imbalance parameterized by the twin cover of a g...
research
02/05/2018

Reducing CMSO Model Checking to Highly Connected Graphs

Given a Counting Monadic Second Order (CMSO) sentence ψ, the CMSO[ψ] pro...
research
04/15/2023

Simple Combinatorial Construction of the k^o(1)-Lower Bound for Approximating the Parameterized k-Clique

In the parameterized k-clique problem, or k-Clique for short, we are giv...
research
04/05/2019

Convex optimization for the densest subgraph and densest submatrix problems

We consider the densest k-subgraph problem, which seeks to identify the ...

Please sign up or login with your details

Forgot password? Click here to reset