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 条

[11] SOFTWARE CONFIGURATION AN NP-COMPLETE PROBLEM
CALABOUGH, J
DATA BASE, 1988, 19 (02): : 29 - 34
[12] A SIMPLIFIED NP-COMPLETE SATISFIABILITY PROBLEM
TOVEY, CA
DISCRETE APPLIED MATHEMATICS, 1984, 8 (01) : 85 - 89
[13] The transposition median problem is NP-complete
Bader, Martin
THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1099 - 1110
[14] THE VIA MINIMIZATION PROBLEM IS NP-COMPLETE
NACLERIO, NJ
MASUDA, S
NAKAJIMA, K
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) : 1604 - 1608
[15] Attaining success is an NP-complete problem
Hemmady, S
COMPUTER, 1996, 29 (11) : 136 - 136
[16] The Cophylogeny Reconstruction Problem Is NP-Complete
Ovadia, Y.
Fielder, D.
Conow, C.
Libeskind-Hadas, R.
JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (01) : 59 - 65
[17] THE GRAPH GENUS PROBLEM IS NP-COMPLETE
THOMASSEN, C
JOURNAL OF ALGORITHMS, 1989, 10 (04) : 568 - 576
[18] Maximizing edge-ratio is NP-complete
Noble, Steven D.
Hansen, Pierre
Mladenovic, Nenad
DISCRETE APPLIED MATHEMATICS, 2011, 159 (18) : 2276 - 2280
[19] Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
Dillencourt, MB
DISCRETE APPLIED MATHEMATICS, 1996, 64 (03) : 207 - 217
[20] Problem kernels for NP-complete edge deletion problems: Split and related graphs
Guo, Jiong
ALGORITHMS AND COMPUTATION, 2007, 4835 : 915 - 926

← 1 2 3 4 5 →