The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186)
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: The maximum independent set problem in subclasses of S_i, j, k-free graphs |
scientific article; zbMATH DE number 6639351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs |
scientific article; zbMATH DE number 6639351 |
Statements
The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (English)
0 references
14 October 2016
0 references
maximum independent set
0 references
augmenting graph
0 references
\(\alpha\)-redundant vertex
0 references
0.8833004236221313
0 references
0.8764830231666565
0 references
0.8591406345367432
0 references
0.8561791777610779
0 references
