Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:38, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential-time algorithms for finding large induced sparse subgraphs |
scientific article |
Statements
Subexponential-time algorithms for finding large induced sparse subgraphs (English)
0 references
26 July 2021
0 references
subexponential algorithm
0 references
feedback vertex set
0 references
\(P_t\)-free graphs
0 references
string graphs
0 references
