Parameterized Complexity of Graph Partitioning into Connected Clusters

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik +1

Given an undirected graph $G$ and $q$ integers $n_1,n_2,n_3,\cdots ,n_q$, balanced connected $q$-partition problem ($BC{P}_q$) asks whether there exists a partition of the vertex se…