EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM

被引:75
作者
GUREVICH, Y [1 ]
SHELAH, S [1 ]
机构
[1] UNIV MICHIGAN,DEPT MATH,ANN ARBOR,MI 48109
关键词
D O I
10.1137/0216034
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:486 / 502
页数:17
相关论文
共 15 条
[1]   FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].
ANGLUIN, D ;
VALIANT, LG .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :155-193
[2]  
BELLMAN R, 1960, 10TH P S APPL MATH A
[3]  
BOLLOBAS B, 1985, 17TH P ANN ACM S THE, P430
[4]  
Bollobas B, 1979, GRAPH THEORY
[5]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[6]  
Erdos P., 1974, PROBABILISTIC METHOD
[7]  
Garey MR., 1979, COMPUTERS INTRACTABI
[8]  
GRAHAM RL, 1983, MATH PROGRAMMING STA
[9]  
GUREVICH Y, 1984, CRLTR5084 U MICH TEC
[10]   A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].
HELD, M ;
KARP, RM .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210