Generalized Independent Sets

Given a graph G on nodes V with undirected edges E, an independent set X is a subset of V such that no edge in E has both endpoints in X. Finding the size of the largest independent set in a graph is currently a very difficult problem. Consider the following generalization of an independent set. A function f that maps each node v to a non-negative value f(v) is said to be a partially generalized