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 条

[1] A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete
Stéphan Ceroi
Order, 2003, 20 : 1 - 11
[2] NP-COMPLETE NUMBER-THEORETIC PROBLEM
GURARI, EM
IBARRA, OH
JOURNAL OF THE ACM, 1979, 26 (03) : 567 - 581
[3] Decision Version of the Road Coloring Problem Is NP-Complete
Roman, Adam
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 287 - 297
[4] CROSSING NUMBER IS NP-COMPLETE
GAREY, MR
JOHNSON, DS
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03): : 312 - 316
[5] SPLITTING NUMBER is NP-complete
Faria, L
de Figueiredo, CMH
Mendonça, CFX
DISCRETE APPLIED MATHEMATICS, 2001, 108 (1-2) : 65 - 83
[6] Splitting number is NP-complete
Faria, L
de Figueiredo, CMH
Mendonça, CFX
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 285 - 297
[7] The weighted independent domination problem is NP-complete for chordal graphs
Chang, GJ
DISCRETE APPLIED MATHEMATICS, 2004, 143 (1-3) : 351 - 352
[8] ON ONE NP-COMPLETE PROBLEM
DEMEL, J
DEMLOVA, M
KYBERNETIKA, 1995, 31 (02) : 207 - 211
[9] AN NP-COMPLETE MATCHING PROBLEM
PLAISTED, DA
ZAKS, S
DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
[10] The STO problem is NP-complete
Krysta, P
Pacholski, L
JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219

← 1 2 3 4 5 →