A weighted version of the jump number problem on two-dimensional orders is NP-complete (Q1404375)

From MaRDI portal
Revision as of 16:01, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A weighted version of the jump number problem on two-dimensional orders is NP-complete
scientific article

    Statements

    A weighted version of the jump number problem on two-dimensional orders is NP-complete (English)
    0 references
    0 references
    0 references
    21 August 2003
    0 references
    jump number
    0 references
    dimension
    0 references
    maximal independent set
    0 references
    NP-completeness
    0 references
    two-dimensional orders
    0 references

    Identifiers