THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE

被引：70

|

作者：

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 条

[1] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE FOR BIPARTITE GRAPHS
LAI, TH
WEI, SS
INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 21 - 26
[2] The maximum edge biclique problem is NP-complete
Peeters, R
DISCRETE APPLIED MATHEMATICS, 2003, 131 (03) : 651 - 654
[3] THE HAMILTONIAN CIRCUIT PROBLEM FOR CIRCLE GRAPHS IS NP-COMPLETE
DAMASCHKE, P
INFORMATION PROCESSING LETTERS, 1989, 32 (01) : 1 - 2
[4] Hamiltonian index is NP-complete
Ryjacek, Zdenek
Woeginger, Gerhard J.
Xiong, Liming
DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 246 - 250
[5] The edge split reconstruction problem for chemical trees is NP-complete
Li, XL
Zhang, XY
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2004, (51) : 205 - 210
[6] ON ONE NP-COMPLETE PROBLEM
DEMEL, J
DEMLOVA, M
KYBERNETIKA, 1995, 31 (02) : 207 - 211
[7] AN NP-COMPLETE MATCHING PROBLEM
PLAISTED, DA
ZAKS, S
DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
[8] The STO problem is NP-complete
Krysta, P
Pacholski, L
JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
[9] A simplified NP-complete MAXSAT problem
Raman, V
Ravikumar, B
Rao, SS
INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
[10] Via minimization problem is NP-complete
Naclerio, Nicholas J., 1604, (38):

← 1 2 3 4 5 →