Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 references
0 references
