The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

Discrete Applied Mathematics

Volumn 158, Issue 16, 2010, Pages 1719-1726

  Adiga, Abhijin ^a   Bhowmick, Diptendu ^a   Sunil Chandran, L ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Approximation hardness; Boxicity; Cubicity; NP completeness; Partial order dimension; Split graph; Threshold dimension

Indexed keywords

APPROXIMATION HARDNESS; BOXICITY; CUBICITY; NP-COMPLETENESS; PARTIAL ORDER; SPLIT GRAPHS; THRESHOLD DIMENSION;

COMPUTATIONAL COMPLEXITY; GEOMETRY; HARDNESS;

GRAPH THEORY;

EID: 77956178481     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.06.017     Document Type: Article

References (14)

1. L.S. Chandran, and K.A. Mathew An upper bound for cubicity in terms of boxicity Discrete Math. 309 8 2009 2571 2574
2. V. Chvtal, and P.L. Hammer Aggregation of inequalities in integer programming Ann. Discrete Math. 1977
3. M.B. Cozzens, Higher and multi-dimensional analogues of interval graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1981.
4. M.B. Cozzens, and M.D. Halsey The relationship between the threshold dimension of split graphs and various dimensional parameters Discrete Appl. Math. 30 1991 125 135
5. B. Dushnik, and E.W. Miller Partially ordered sets Amer. J. Math. 6 3 1941 600 610
6. S. Foldes, P.L. Hammer, Split graphs, in: Proceedings of the 8th SouthEastern Conference on Combinatorics, Graph Theory and Computing, 1977.
7. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
8. R. Hegde, and K. Jain The hardness of approximating poset dimension Electron. Notes Discrete Math. 29 2007 435 443
9. J. Kratochvl A special planar satisfiability problem and a consequence of its NP-completeness Discrete Appl. Math. 52 1994 233 252
10. F.S. Roberts Recent Progresses in Combinatorics, Chap. On the Boxicity and Cubicity of a Graph 1969 Academic Press New York pp. 301310
11. W.T. Trotter Combinatorics and Partially Ordered Sets: Dimension Theory 1992 The Johns Hopkins University Press Baltimore, Maryland
12. W.T. Trotter, Graphs and partially ordered sets: recent results and new directions, in: Surveys in Graph Theory, San Francisco, CA, 1995, Congr. Numer. vol. 116, 1996.
13. R.I. Tyshkevich, and A.A. Chernyak Canonical partition of a graph defined by the degrees of its vertices Isv. Akad. Nauk BSSR, Ser. Fiz. -Mat. Nauk 1979 (in Russian)
14. M. Yannakakis The complexity of the partial order dimension problem SIAM J. Alg. Discrete Math. 3 3 1982 351 358