Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073)
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: Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization |
scientific article |
Statements
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (English)
0 references
10 December 2013
0 references
0.89245886
0 references
0.89245886
0 references
0.8900935
0 references
0.88940126
0 references
0.8828875
0 references
0.8819793
0 references
0.87002057
0 references
0.8700205
0 references
