An O*(1.0821n)-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.