Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (Q3503575)
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 5285021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem |
scientific article; zbMATH DE number 5285021 |
Statements
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (English)
0 references
5 June 2008
0 references
0.8948430418968201
0 references
0.8077802658081055
0 references
0.7864704728126526
0 references
0.777966320514679
0 references
0.7740123271942139
0 references
