An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem |
scientific article |
Statements
An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (English)
0 references
1986
0 references
case analysis
0 references
deterministic upper bound
0 references
NP-completeness
0 references
