Trukhanov, Svyatoslav; Balasubramaniam, Chitra; … - In: Computational Optimization and Applications 56 (2013) 1, pp. 113-130
Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable....
