An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.1986.1676847 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971756951 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 2024
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
