A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1944857.1944860 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052227003 / rank | |||
Normal rank | |||
Revision as of 01:14, 20 March 2024
scientific article; zbMATH DE number 6485164
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems |
scientific article; zbMATH DE number 6485164 |
Statements
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (English)
0 references
24 September 2015
0 references
iterative compression
0 references
computational complexity
0 references
graph algorithms
0 references
hereditary graph properties
0 references
parameterized complexity
0 references
vertex deletion problems
0 references
