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 条
  • [41] Statistical mechanics of an NP-complete problem: subset sum
    Sasamoto, T
    Toyoizumi, T
    Nishimori, H
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2001, 34 (44): : 9555 - 9567
  • [42] The synthesis problem for elementary net systems is NP-complete
    Badouel, E
    Bernardinello, L
    Darondeau, P
    THEORETICAL COMPUTER SCIENCE, 1997, 186 (1-2) : 107 - 134
  • [43] Exponential complexity of an adiabatic algorithm for an NP-complete problem
    Znidaric, M
    Horvat, M
    PHYSICAL REVIEW A, 2006, 73 (02):
  • [44] THE HAMILTONIAN CIRCUIT PROBLEM FOR CIRCLE GRAPHS IS NP-COMPLETE
    DAMASCHKE, P
    INFORMATION PROCESSING LETTERS, 1989, 32 (01) : 1 - 2
  • [45] An Average Case NP-complete Graph Colouring Problem
    Levin, Leonid A.
    Venkatesan, Ramarathnam
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (05): : 808 - 828
  • [46] The two-dimensional weighted median problem
    Vygen, J
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1997, 77 : S433 - S436
  • [47] RECOGNIZING GRAPHS WITH FIXED-INTERVAL NUMBER IS NP-COMPLETE
    WEST, DB
    SHMOYS, DB
    DISCRETE APPLIED MATHEMATICS, 1984, 8 (03) : 295 - 305
  • [48] ACHROMATIC NUMBER IS NP-COMPLETE FOR COGRAPHS AND INTERVAL-GRAPHS
    BODLAENDER, HL
    INFORMATION PROCESSING LETTERS, 1989, 31 (03) : 135 - 138
  • [49] Recognizing DAGs with Page-Number 2 Is NP-complete
    Bekos, Michael A.
    Da Lozzo, Giordano
    Frati, Fabrizio
    Gronemann, Martin
    Mchedlidze, Tamara
    Raftopoulou, Chrysanthi N.
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 : 361 - 370
  • [50] Recognizing DAGs with page-number 2 is NP-complete
    Bekos, Michael A.
    Da Lozzo, Giordano
    Frati, Fabrizio
    Gronemann, Martin
    Mchedlidze, Tamara
    Raftopoulou, Chrysanthi N.
    THEORETICAL COMPUTER SCIENCE, 2023, 946
12345