Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Algorithms and Complexity of Hedge Cluster Deletion Problems
Athanasios L. Konstantinidis, Charis Papadopoulos, Georgios Velissaris
A hedge graph is a graph whose edge set has been partitioned into groups called hedges. Here we consider a generalization of the well-known \textsc{Cluster Deletion} problem, named…
cs.DS2019
Cluster Deletion on Interval Graphs and Split Related Graphs
Athanasios L. Konstantinidis, Charis Papadopoulos
In the {\sc Cluster Deletion} problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a c…
cs.DS2018
Parameterized Aspects of Strong Subgraph Closure
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis +2
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized…