The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091388992 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0903.1010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for cubicity in terms of boxicity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4165164 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The relationship between the threshold dimension of split graphs and various dimensional parameters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partially Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4193514 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Hardness of Approximating Poset Dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:56, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The hardness of approximating the boxicity, cubicity and threshold dimension of a graph |
scientific article |
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