The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742): Difference between revisions

@@ Property / cites work @@
+An upper bound for cubicity in terms of boxicity
@@ Property / cites work: An upper bound for cubicity in terms of boxicity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4165164
@@ Property / cites work: Q4165164 / rank @@
+Normal rank
@@ Property / cites work @@
+The relationship between the threshold dimension of split graphs and various dimensional parameters
+Normal rank
@@ Property / cites work @@
+Partially Ordered Sets
@@ Property / cites work: Partially Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardness of Approximating Poset Dimension
@@ Property / cites work: The Hardness of Approximating Poset Dimension / rank @@
+Normal rank
@@ Property / cites work @@
+A special planar satisfiability problem and a consequence of its NP- completeness
+Normal rank
@@ Property / cites work @@
+Q5588433
@@ Property / cites work: Q5588433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852226
@@ Property / cites work: Q3852226 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank