  We give an $O^*(1.0821^n)$-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.
