30 citations · 100 across the 41 of their papers we have counts for
4 papers · 1 filter
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…
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
Iyad Kanj, Christian Komusiewicz, Manuel Sorge +1
A fundamental graph problem is to recognize whether the vertex set of a graph can be bipartitioned into sets and such that and satisfy properties an…
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier +1
Finding large "cliquish" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter…
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…