A refined algorithm for maximum independent set in degree-4 graphs (Q1680494)
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 6807517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A refined algorithm for maximum independent set in degree-4 graphs |
scientific article; zbMATH DE number 6807517 |
Statements
A refined algorithm for maximum independent set in degree-4 graphs (English)
0 references
16 November 2017
0 references
exact algorithms
0 references
graph algorithms
0 references
maximum independent set
0 references
measure-and-conquer
0 references
amortized analysis
0 references
0 references
0 references
0 references
0 references
0.935339093208313
0 references
0.8565035462379456
0 references
0.8513756394386292
0 references
0.8450128436088562
0 references
0.8433815240859985
0 references
