THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引:38
作者
JOHNSON, DS [1 ]
机构
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
关键词
D O I
10.1016/0196-6774(84)90045-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:147 / 160
页数:14
相关论文
共 86 条
[31]   THE HAMILTONIAN CIRCUIT PROBLEM IS POLYNOMIAL FOR 4-CONNECTED PLANAR GRAPHS [J].
GOUYOUBEAUCHAMPS, D .
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :529-539
[32]  
GUREVICH Y, 1982, RC9348 IBM RES REP
[33]  
HEDETNIEMI ST, 1983, 433 CLEMS U DEP MATH
[34]  
Hirata T., 1979, Transactions of the Institute of Electronics and Communication Engineers of Japan, Section E (English), VE62, P449
[35]  
HSU WL, 1982, OPER RES LETT, V1, P96
[36]  
IBARAKI T, 1982, IEEE T COMPUT, V31, P188, DOI 10.1109/TC.1982.1675974
[37]   HAMILTON PATHS IN GRID GRAPHS [J].
ITAI, A ;
PAPADIMITRIOU, CH ;
SZWARCFITER, JL .
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) :676-686
[38]  
Karmarkar N., 1982, 23rd Annual Symposium on Foundations of Computer Science, P312, DOI 10.1109/SFCS.1982.61
[39]  
KARPLUS K, 1982, STANCS82959 STANF U
[40]  
KEIL JM, 1983, 16383 U TOR DEP COMP