An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs |
scientific article |
Statements
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (English)
0 references
5 June 2008
0 references
