On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741)
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: On the (parameterized) complexity of recognizing well-covered (r,)-graph |
scientific article; zbMATH DE number 6944699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph |
scientific article; zbMATH DE number 6944699 |
Statements
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (English)
0 references
27 September 2018
0 references
well-covered graph
0 references
\((r, \ell)\)-graph
0 references
coNP-completeness
0 references
FPT-algorithm
0 references
parameterized complexity
0 references
coW[2]-hardness
0 references
0.9884341955184937
0 references
0.8364982008934021
0 references
0.7847082614898682
0 references
0.7788921594619751
0 references
0.7764920592308044
0 references
