Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q322248 |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Paweł Rzążewski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3046548273 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1910.01082 / rank | |||
Normal rank | |||
Latest revision as of 01:15, 19 April 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
