Parameterized complexity of independent set in H-free graphs (Q786045)
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: Parameterized complexity of independent set in H-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of independent set in H-free graphs |
scientific article |
Statements
Parameterized complexity of independent set in H-free graphs (English)
0 references
12 August 2020
0 references
parameterized algorithms
0 references
independent set
0 references
H-free graphs
0 references
0 references
0 references
0.9953498840332032
0 references
0.8261750936508179
0 references
0.8170461654663086
0 references
0.8068177700042725
0 references
