Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3046548273 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1910.01082 / rank | |||
Normal rank |
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