On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs (Q2958335)
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 6679781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs |
scientific article; zbMATH DE number 6679781 |
Statements
On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (English)
0 references
1 February 2017
0 references
well-covered graph
0 references
\((r,\ell)\)-graph
0 references
coNP-completeness
0 references
FPT-algorithm
0 references
parameterized complexity
0 references
polynomial kernel
0 references
0.9884341955184937
0 references
0.8314751386642456
0 references
0.7906162142753601
0 references
0.7775529026985168
0 references
0.7754040956497192
0 references
