Complexity and kernels for bipartition into degree-bounded induced graphs (Q2942649)
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 6480932
| 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 6480932 |
Statements
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (English)
0 references
11 September 2015
0 references
0 references
0.9780237674713136
0 references
0.8037351369857788
0 references
0.7912169098854065
0 references
0.7838864326477051
0 references
0.7632049918174744
0 references
