An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56210422, #quickstatements; #temporary_batch_1706398787052 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56210422 / rank | |||
Normal rank | |||
Revision as of 12:08, 28 January 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
