Complexity and parameterized algorithms for cograph editing (Q690461)
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 6110688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and parameterized algorithms for cograph editing |
scientific article; zbMATH DE number 6110688 |
Statements
Complexity and parameterized algorithms for cograph editing (English)
0 references
27 November 2012
0 references
cograph editing
0 references
NP-hardness
0 references
parameterized algorithms
0 references
\(P_{4}\)-sparse graph
0 references
0.983001947402954
0 references
0.8650790452957153
0 references
0.8270583152770996
0 references
0.7975754141807556
0 references
0.7934697866439819
0 references
