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

From MaRDI portal
Revision as of 15:19, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
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
    0 references
    0 references
    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

    Identifiers