A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs (Q3525784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs |
scientific article; zbMATH DE number 5345293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs |
scientific article; zbMATH DE number 5345293 |
Statements
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs (English)
0 references
18 September 2008
0 references
maximum independent set
0 references
exponential time algorithm
0 references
sparse graph
0 references
NP-hard
0 references
0.8852069973945618
0 references
0.8844910264015198
0 references
0.8830747008323669
0 references
0.8752185702323914
0 references
