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

被引：2
|
作者：
Ceroi, S [1 ]
机构：
[1] LIRMM, F-34392 Montpellier 5, France
来源：
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 2003年 / 20卷 / 01期
关键词：
jump number; dimension; maximal independent set;
D O I：
10.1023/A:1024417802690
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove the NP-completeness of a weighted version of the jump number problem on two-dimensional orders, by reducing the Maximum Independent Set on cubic planar graphs, using a geometrical construction.
引用
收藏
页码：1 / 11
页数：11
相关论文
共 50 条
12345