DeepAI AI Chat
Log In Sign Up

Improved Parameterized Complexity of Happy Set Problems

by   Yosuke Mizutani, et al.

We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Maximum Edge Happy Set (MaxEHS)–also known as Densest k-Subgraph. Given a graph G and an integer k, MaxHS asks for a set S of k vertices such that the number of happy vertices with respect to S is maximized, where a vertex v is happy if v and all its neighbors are in S. We show that MaxHS can be solved in time π’ͺ(2^Β·Β· k^2 Β· |V(G)|) and π’ͺ(8^Β· k^2 Β· |V(G)|), where and denote the modular-width and the clique-width of G, respectively. This resolves the open questions posed in literature. The MaxEHS problem is an edge-variant of MaxHS, where we maximize the number of happy edges, the edges whose endpoints are in S. In this paper we show that MaxEHS can be solved in time f()Β·|V(G)|^π’ͺ(1) and π’ͺ(2^Β· k^2 Β· |V(G)|), where and denote the neighborhood diversity and the cluster deletion number of G, respectively, and f is some computable function. This result implies that MaxEHS is also fixed-parameter tractable by twin cover number.


page 1

page 3

page 5

page 7

page 9

page 13

page 15

page 17

βˆ™ 01/07/2019

On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k β‰₯ 1, we prove that k-Edge Colouring is fixed-p...
βˆ™ 07/20/2022

Computing Densest k-Subgraph with Structural Parameters

Densest k-Subgraph is the problem to find a vertex subset S of size k su...
βˆ™ 02/01/2023

Parameterized Algorithms for Colored Clustering

In the Colored Clustering problem, one is asked to cluster edge-colored ...
βˆ™ 05/01/2019

Independent Set Reconfiguration Parameterized by Modular-Width

Independent Set Reconfiguration is one of the most well-studied problems...
βˆ™ 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...
βˆ™ 08/26/2022

Computing Clique Cover with Structural Parameterization

An abundance of real-world problems manifest as covering edges and/or ve...
βˆ™ 01/22/2020

Iterated Type Partitions

This paper deals with the complexity of some natural graph problems when...