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.

翻译：我们给出一个 $O ⁇ ( 1.0821 ⁇ n) $- time, 多元空间算法, 用于在3 号约束度的图表中计算最大独立集 。 这样可以改进所有先前的运行时间段 。