Regarding algorithms to find maximal independent set in an unweighted and undirected graph: I saw many articles online that are referring to the case of which every vertex has a maximal degree of d, and then you can find an independent set of size n/(d+1) (for each such vertex, add it to the independent set and remove its neighbors from the graph).  But is there an approach on how to handle with vertices with a larger degree than d? Something about the group of neighbors of the vertex maybe?
Maximal Independent Set
graph theory;graphs;algorithm analysis;approximation