Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-018-0479-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-018-0479-5 / rank | |||
Normal rank | |||
Latest revision as of 05:58, 11 December 2024
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
