Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\) (Q3569091)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5723196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\) |
scientific article; zbMATH DE number 5723196 |
Statements
Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (English)
0 references
17 June 2010
0 references
0.8783214092254639
0 references
0.8734112977981567
0 references
0.8728584051132202
0 references
0.8548719882965088
0 references
0.8504558205604553
0 references
