The parameterized complexity of editing graphs for bounded degeneracy (Q986553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The parameterized complexity of editing graphs for bounded degeneracy |
scientific article; zbMATH DE number 5768913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity of editing graphs for bounded degeneracy |
scientific article; zbMATH DE number 5768913 |
Statements
The parameterized complexity of editing graphs for bounded degeneracy (English)
0 references
11 August 2010
0 references
combinatorial problems
0 references
computational complexity
0 references
parameterized complexity
0 references
degenerate graphs
0 references
graph editing
0 references
0 references
0 references
0.8334677815437317
0 references
0.8194032907485962
0 references
0.8188628554344177
0 references
0.8113231062889099
0 references
0.8109665513038635
0 references
