Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6668319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and kernels for bipartition into degree-bounded induced graphs |
scientific article; zbMATH DE number 6668319 |
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
0.9780237674713136
0 references
0.7924937009811401
0 references
0.7874077558517456
0 references
0.7802773118019104
0 references
0.7781250476837158
0 references
