An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3980507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem |
scientific article; zbMATH DE number 3980507 |
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
0.8975566029548645
0 references
0.8830747008323669
0 references
0.8672102689743042
0 references
0.845786452293396
0 references
