The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742)
From MaRDI portal
!
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 5810801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of approximating the boxicity, cubicity and threshold dimension of a graph |
scientific article; zbMATH DE number 5810801 |
Statements
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (English)
0 references
5 November 2010
0 references
boxicity
0 references
cubicity
0 references
threshold dimension
0 references
partial order dimension
0 references
split graph
0 references
NP-completeness
0 references
approximation hardness
0 references
0 references
0.9000653
0 references
0.88660634
0 references
0.88660634
0 references
0 references
0.88397586
0 references
0.8814628
0 references
0 references
0 references
