On the hardness of computing span of subcubic graphs (Q888955)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6504971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of computing span of subcubic graphs |
scientific article; zbMATH DE number 6504971 |
Statements
On the hardness of computing span of subcubic graphs (English)
0 references
5 November 2015
0 references
subcubic graphs
0 references
span
0 references
vertex coloring
0 references
computational complexity
0 references
0.8045722842216492
0 references
0.7775671482086182
0 references
0.7658600807189941
0 references
0.7571201324462891
0 references
0.7526679039001465
0 references
