Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
