Edge-editing to a dense and a sparse graph class (Q2802969)
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 6576696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-editing to a dense and a sparse graph class |
scientific article; zbMATH DE number 6576696 |
Statements
Edge-Editing to a Dense and a Sparse Graph Class (English)
0 references
3 May 2016
0 references
graph modification problems
0 references
clique-editing
0 references
degeneracy
0 references
parameterized complexity
0 references
treewidth
0 references
0.8109665513038635
0 references
0.7878984808921814
0 references
0.7875441312789917
0 references
0.7798038721084595
0 references
0.775245189666748
0 references
