On the Relation of Strong Triadic Closure and Cluster Deletion

by   Niels Grüttemeier, et al.
Philipps-Universität Marburg

We study the parameterized and classical complexity of two related problems on undirected graphs G=(V,E). In Strong Triadic Closure we aim to label the edges in E as strong and weak such that at most k edges are weak and G contains no induced P_3 with two strong edges. In Cluster Deletion, we aim to destroy all induced P_3s by a minimum number of edge deletions. We first show that Strong Triadic Closure admits a 4k-vertex kernel. Then, we study parameterization by ℓ:=|E|-k and show that both problems are fixed-parameter tractable and unlikely to admit a polynomial kernel with respect to ℓ. Finally, we give a dichotomy of the classical complexity of both problems on H-free graphs for all H of order four.


page 1

page 2

page 3

page 4


Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Given an undirected graph G and integers c and k, the Maximum Edge-Color...

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

We study the computational complexity of c-Colored P_ℓ Deletion and c-Co...

Improved Kernels for Edge Modification Problems

In an edge modification problem, we are asked to modify at most k edges ...

Exploiting 𝐜-Closure in Kernelization Algorithms for Graph Problems

A graph is c-closed if every pair of vertices with at least c common nei...

Generating Weakly Chordal Graphs from Arbitrary Graphs

We propose a scheme for generating a weakly chordal graph from a randoml...

Please sign up or login with your details

Forgot password? Click here to reset