The Complexity of Maximum $k$-Order Bounded Component Set Problem

Sounaka Mishra, Shijin Rajakrishnan

Given a graph $G=(V,E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S\subseteq V$ of maximum size…