A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs (Q3525784)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs |
scientific article |
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
