On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs |
scientific article |
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
