THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE

被引：71
|
作者：
BERTOSSI, AA
机构：
来源：
INFORMATION PROCESSING LETTERS | 1981年 / 13卷 / 4-5期
关键词：
D O I：
10.1016/0020-0190(81)90048-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：157 / 159
页数：3
相关论文
共 50 条
  • [41] The minimal logically-defined NP-complete problem
    Barbanchon, R
    Grandjean, E
    STACS 2004, PROCEEDINGS, 2004, 2996 : 338 - 349
  • [42] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
  • [43] 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
  • [44] HIROIMONO is NP-Complete
    Andersson, Daniel
    Fun with Algorithms, Proceedings, 2007, 4475 : 30 - 39
  • [45] Tipover is NP-complete
    Robert A. Hearn
    The Mathematical Intelligencer, 2006, 28 : 10 - 14
  • [46] BLOCKSUM is NP-Complete
    Haraguchi, Kazuya
    Ono, Hirotaka
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
  • [47] TipOver is NP-complete
    Hearn, Robert A.
    MATHEMATICAL INTELLIGENCER, 2006, 28 (03) : 10 - 14
  • [48] Minesweeper is NP-complete
    Kaye, R
    MATHEMATICAL INTELLIGENCER, 2000, 22 (02) : 9 - 15
  • [49] Exponential complexity of an adiabatic algorithm for an NP-complete problem
    Znidaric, M
    Horvat, M
    PHYSICAL REVIEW A, 2006, 73 (02):
  • [50] Decision Version of the Road Coloring Problem Is NP-Complete
    Roman, Adam
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 287 - 297
12345