A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797)
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 6773893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs |
scientific article; zbMATH DE number 6773893 |
Statements
A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (English)
0 references
12 September 2017
0 references
independent set
0 references
\(P_t\)-free
0 references
subexponential-time algorithm
0 references
0.9744579
0 references
0.92738706
0 references
0.91698074
0 references
0.91260815
0 references
0.9059961
0 references
0.9058281
0 references
0.9058123
0 references
