An Independent Set Based Approach Using Random Degree Selection Distributed Algorithm for Graph Coloring

This paper deals with algorithms for maximal independent set on random and manual graphs. The maximum independent set problem (MIS) is one of the optimization problems and it is an important component of many networking algorithms. This problem is relevant for many practical applications such as register allocation in a compiler, assigning channels to radio station, scheduling of examinations, graph coloring. A maximal independent set is also a dominating set in the graph, and every dominating set that is independent must be maximal independent, so maximal independent sets are also called independent dominating sets.