Title of article
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph Original Research Article
Author/Authors
Abhijin Adiga، نويسنده , , Diptendu Bhowmick، نويسنده , , L. Sunil Chandran، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
1719
To page
1726
Keywords
Split graph , Boxicity , NPNP-completeness , Approximation hardness , Threshold dimension , Cubicity , Partial order dimension
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887495
Link To Document