An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
Data Structures and Algorithms
2022-06-20 v4
Abstract
We give an -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.
Cite
@article{arxiv.1308.1351,
title = {An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3},
author = {Davis Issac and Ragesh Jaiswal},
journal= {arXiv preprint arXiv:1308.1351},
year = {2022}
}
Comments
While working on an updated version, we observed a bug in one of the cases of our extensive case analysis. We are withdrawing this paper while we work to fix the bug. We will add an updated version once we manage to fix the bug