An O^*(1.0821^n)-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3 [article]

Davis Issac, Ragesh Jaiswal
2022 arXiv   pre-print
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.
arXiv:1308.1351v4 fatcat:nys52c6vxrgk7eiykhokka2lme