Academic Journal
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
| العنوان: | The hardness of approximating the boxicity, cubicity and threshold dimension of a graph |
|---|---|
| المؤلفون: | Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://arxiv.org/pdf/0903.1010.pdf. |
| سنة النشر: | 2010 |
| المجموعة: | CiteSeerX |
| مصطلحات موضوعية: | Boxicity, Cubicity, Threshold dimension, Partial order dimension, Split graph, NP-completeness, Approximation hardness |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.9042; http://arxiv.org/pdf/0903.1010.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.9042 http://arxiv.org/pdf/0903.1010.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.CB8FF65F |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |