A novel branching strategy for parameterized graph modification problems (Q3066469)
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: A novel branching strategy for parameterized graph modification problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel branching strategy for parameterized graph modification problems |
scientific article |
Statements
A Novel Branching Strategy for Parameterized Graph Modification Problems (English)
0 references
10 January 2011
0 references
fixed-parameter tractability
0 references
edge-deletion
0 references
graph modification
0 references
cographs
0 references
trivially perfect graphs
0 references
quasi-threshold graphs
0 references
bounded search tree
0 references
0.9094748497009276
0 references
0.8746023774147034
0 references
0.8656916618347168
0 references
0.8171303868293762
0 references
0.765977680683136
0 references
