Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002)
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-time solvability of the independent set problem in a certain class of subcubic planar graphs |
scientific article; zbMATH DE number 6857056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs |
scientific article; zbMATH DE number 6857056 |
Statements
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (English)
0 references
6 April 2018
0 references
independent set problem
0 references
graph reduction
0 references
efficient algorithm
0 references
0 references
0 references
0.872653067111969
0 references
0.8691484332084656
0 references
0.8546758890151978
0 references
0.8503196239471436
0 references
