Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 1 February 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
