Parameterized Algorithms for Colored Clustering

02/01/2023
โˆ™
by   Leon Kellerhals, et al.
โˆ™
0
โˆ™

In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an endpoint and are colored differently. Equivalently, the goal can also be described as assigning colors to the vertices in a way that fits the edge-coloring as well as possible. As this problem is NP-hard, we build on previous work by studying its parameterized complexity. We give a 2^๐’ช(k)ยท n^๐’ช(1)-time algorithm where k is the number of edges to be selected and n the number of vertices. We also prove the existence of a problem kernel of size ๐’ช(k^5/2 ), resolving an open problem posed in the literature. We consider parameters that are smaller than k, the number of edges to be selected, and r, the number of edges that can be deleted. Such smaller parameters are obtained by considering the difference between k or r and some lower bound on these values. We give both algorithms and lower bounds for Colored Clustering with such parameterizations. Finally, we settle the parameterized complexity of Colored Clustering with respect to structural graph parameters by showing that it is W[1]-hard with respect to both vertex cover number and tree-cut width, but fixed-parameter tractable with respect to slim tree-cut width.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 01/09/2020

Parameterized Complexity of Geodetic Set

A vertex set S of a graph G is geodetic if every vertex of G lies on a s...
research
โˆ™ 07/14/2022

Improved Parameterized Complexity of Happy Set Problems

We present fixed-parameter tractable (FPT) algorithms for two problems, ...
research
โˆ™ 02/09/2023

A new width parameter of graphs based on edge cuts: ฮฑ-edge-crossing width

We introduce graph width parameters, called ฮฑ-edge-crossing width and ed...
research
โˆ™ 11/21/2019

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters

We continue and extend previous work on the parameterized complexity ana...
research
โˆ™ 01/14/2022

Covering Many (or Few) Edges with k Vertices in Sparse Graphs

We study the following two fixed-cardinality optimization problems (a ma...
research
โˆ™ 08/21/2023

Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability

In the Minimum Bisection problem, input is a graph G and the goal is to ...
research
โˆ™ 05/21/2018

A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree

A rooted tree Rโƒ— is a rooted subtree of a tree T if the tree obtained by...

Please sign up or login with your details

Forgot password? Click here to reset