A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184): 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:16, 3 February 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
