Abstract
We consider the maximum independent set (MIS) problem, i.e., the problem asking for a vertex subset of maximum cardinality of a graph such that no two vertices in this set are adjacent. The problem is known to be NP-hard in general, even if restricted on graphs of maximum degree at most Δ for a given integer Δ ≥ 3, i.e., every vertex is of degree at most Δ. We try to figure out some bounded maximum degree graph classes, under which the problem can be solved in polynomial time.
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.
