activity
20182025
most citedEfficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.DS2018

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

Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz +1

Given an undirected graph the NP-hard Strong Triadic Closure (STC) problem asks for a labeling of the edges as \emph{weak} and \emph{strong} such that at most edges a…

cs.DS2018

On the Relation of Strong Triadic Closure and Cluster Deletion

Niels Grüttemeier, Christian Komusiewicz

We study the parameterized and classical complexity of two related problems on undirected graphs . In Strong Triadic Closure we aim to label the edges in as strong and…