A weighted version of the jump number problem on two-dimensional orders is NP-complete (Q1404375): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1024417802690 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W97390432 / rank | |||
Normal rank | |||
Latest revision as of 08:25, 30 July 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
