Editing graphs to satisfy degree constraints: a parameterized approach (Q414866)
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 6033487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Editing graphs to satisfy degree constraints: a parameterized approach |
scientific article; zbMATH DE number 6033487 |
Statements
Editing graphs to satisfy degree constraints: a parameterized approach (English)
0 references
11 May 2012
0 references
parameterized complexity
0 references
computational complexity
0 references
kernelization
0 references
graph editing
0 references
regular subgraph
0 references
general factor
0 references
0.8687445521354675
0 references
0.86406010389328
0 references
0.8633426427841187
0 references
0.849136233329773
0 references
