Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion problems are computationally hard, with polynomial-time algorithms only for specific graph classes and target densities.
