An exact algorithm for maximum independent set in degree-5 graphs (Q896662)
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: An exact algorithm for maximum independent set in degree-5 graphs |
scientific article; zbMATH DE number 6519409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for maximum independent set in degree-5 graphs |
scientific article; zbMATH DE number 6519409 |
Statements
An exact algorithm for maximum independent set in degree-5 graphs (English)
0 references
10 December 2015
0 references
exact algorithm
0 references
graph algorithm
0 references
maximum independent set
0 references
measure and conquer
0 references
amortized analysis
0 references
0 references
0 references
0 references
0.9180305
0 references
0.9082415
0 references
0.9051622
0 references
0.90506756
0 references
0 references
0 references
0.90025455
0 references
0.8997756
0 references
