Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and kernels for bipartition into degree-bounded induced graphs |
scientific article |
Statements
Complexity and kernels for bipartition into degree-bounded induced graphs (English)
0 references
23 December 2016
0 references
graph algorithms
0 references
bipartition
0 references
kernelization
0 references
NP-hard
0 references
fixed-parameter tractable
0 references
