We give an O∗(1.0821n)-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.

This article outlines the content, ways of organizing students' independent learning, types and objectives learning. It also reveals levels criteria learning activities, stages implementation developing skills competence working independently, as well degrees