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

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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