On the maximum independent set problem in subclasses of subcubic graphs (Q2018543)
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: On the maximum independent set problem in subclasses of subcubic graphs |
scientific article; zbMATH DE number 6419172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum independent set problem in subclasses of subcubic graphs |
scientific article; zbMATH DE number 6419172 |
Statements
On the maximum independent set problem in subclasses of subcubic graphs (English)
0 references
24 March 2015
0 references
independent set
0 references
polynomial-time algorithm
0 references
subcubic graph
0 references
APX-completeness
0 references
0 references
0.9782845377922058
0 references
0.936299741268158
0 references
0.9319090247154236
0 references
0.8684114813804626
0 references
