Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633)
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: Subexponential-time algorithms for maximum independent set in P_t-free and broom-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs |
scientific article |
Statements
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (English)
0 references
14 February 2019
0 references
independent set
0 references
subexponential algorithms
0 references
approximation
0 references
scattered set
0 references
\(H\)-free graphs
0 references
0 references
0 references
0 references
0.9336989521980286
0 references
0.8928053975105286
0 references
0.8289800882339478
0 references
0.7965726256370544
0 references
0.7942177653312683
0 references
