A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract) (Q3404455)
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 5667874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract) |
scientific article; zbMATH DE number 5667874 |
Statements
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs (English)
0 references
9 February 2010
0 references
0.9111953973770142
0 references
0.8852069973945618
0 references
0.8792386651039124
0 references
0.8783214092254639
0 references
0.8724287748336792
0 references
