Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201)
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: Polynomial algorithms for the maximum stable set problem on particular classes of P₅-free graphs |
scientific article; zbMATH DE number 6588285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs |
scientific article; zbMATH DE number 6588285 |
Statements
Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (English)
0 references
1 June 2016
0 references
polynomial algorithms
0 references
combinatorial problems
0 references
computational complexity
0 references
stable set
0 references
