A weighted version of the jump number problem on two-dimensional orders is NP-complete (Q1404375): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:01, 31 January 2024
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
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
