Davis Issac

most citedAn

O^{*} (1.082 1^{n})

-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2013★ 4 cited

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

Davis Issac, Ragesh Jaiswal

We give an $O^{*} (1.082 1^{n})$ -time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bound…

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

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