Blar i Faculty of Mathematics and Natural Sciences på emneord "Cluster vertex deletion clustering parameterized complexity"
Viser treff 1-1 av 1
-
Parameterized Complexity of Fair Graph Clustering
(Master thesis, 2022-08-29)The problem of $\alpha-$ \textsl{BALANCED CLUSTER VERTEX DELETION} where \(\alpha \geq 1 \) is some constant, asks whether it is possible to delete at most \(k\) vertecies from a vertex colored graph such that that it ...