THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引:39
作者
JOHNSON, DS [1 ]
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
关键词
D O I
10.1016/0196-6774(87)90043-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:285 / 303
页数:19
相关论文
共 63 条
[1]  
ABELLO J, 1987, UNPUB SOME APPLICATI
[2]  
Arnborg S, 1984, TRITANA8404 ROYAL I
[3]  
ARNBORG S, 1984, TRITANA8407 ROYAL I
[4]   AN APPROACH TO THE SUBGRAPH HOMEOMORPHISM PROBLEM [J].
ASANO, T .
THEORETICAL COMPUTER SCIENCE, 1985, 38 (2-3) :249-267
[5]  
BIENSTOCK D, 1986, UNPUB COMPLEXITY COV
[6]   O(N2.5) TIME ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM PROBLEM ON TREES [J].
CHUNG, MJ .
JOURNAL OF ALGORITHMS, 1987, 8 (01) :106-112
[7]   EXACT AND APPROXIMATE SOLUTIONS FOR THE GATE MATRIX LAYOUT PROBLEM [J].
DEO, N ;
KRISHNAMOORTHY, MS ;
LANGSTON, MA .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (01) :79-84
[8]   SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :241-+
[9]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[10]  
FELLOWS MR, 1985, UNPUB TOPOLOGICAL PA