On the Parameterized Complexity of Bounded-Density Vertex Deletion

Jakob Raupach, Tom-Lukas Breitkopf, Anton Herrmann +1

We explore the parameterized complexity of Bounded Density Vertex Deletion (BDVD): given a graph $G$, an integer budget $k$, and a target density $\ddot{I}{„}_{\ddot{I}}$, the task is to determine…