2 problems

A graph $H$ is a cluster graph if it is a vertex-disjoint union of cliques. For fixed natural numbers $a$ and $d$, the $(a,d)$-Cluster Editing problem asks, given a graph $G$ and v…

Bounded-pathwidth tractability conjecture. The problem can be solved in polynomial time under these restrictions.