Obtaining split graphs by edge contraction (Q897961)
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: Obtaining split graphs by edge contraction |
scientific article; zbMATH DE number 6517488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining split graphs by edge contraction |
scientific article; zbMATH DE number 6517488 |
Statements
Obtaining split graphs by edge contraction (English)
0 references
8 December 2015
0 references
parameterized complexity
0 references
edge contraction
0 references
split graphs
0 references
FPT algorithm
0 references
incompressibility
0 references
0.9911344647407532
0 references
0.8722797632217407
0 references
0.8406962156295776
0 references
0.8094067573547363
0 references
