A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs |
scientific article |
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
