Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1804.04077 / rank | |||
Normal rank | |||
Latest revision as of 22:24, 18 April 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
