Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106)
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: Maximum independent sets in subclasses of P₅-free graphs |
scientific article; zbMATH DE number 5721994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum independent sets in subclasses of \(P_{5}\)-free graphs |
scientific article; zbMATH DE number 5721994 |
Statements
Maximum independent sets in subclasses of \(P_{5}\)-free graphs (English)
0 references
16 June 2010
0 references
graph algorithms
0 references
independent set
0 references
\(P_{5}\)-free graphs
0 references
0 references
0 references
0.918839395046234
0 references
0.8735663294792175
0 references
0.8646431565284729
0 references
0.857886016368866
0 references
0.8577914834022522
0 references
