HAMILTON PATHS IN GRID GRAPHS

被引：333

作者：

ITAI, A

PAPADIMITRIOU, CH

SZWARCFITER, JL

机构：

[1] UNIV CALIF BERKELEY, DEPT ELECT ENGN & COMP SCI, BERKELEY, CA 94720 USA

[2] MIT, COMP SCI LAB, CAMBRIDGE, MA 02139 USA

[3] NATL TECH UNIV ATHENS, GR-147 ATHENS, GREECE

[4] UNIV FED RIO DE JANEIRO, RIO DE JANEIRO, RJ, BRAZIL

来源：

关键词：

D O I：

10.1137/0211056

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：676 / 686

页数：11

共 10 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Garey M. R., 1976, SIAM Journal on Computing, V5, P704, DOI 10.1137/0205049

[3]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[4]

Karp R.M., 1972, COMPLEXITY COMPUTER

[5]

Krishnamoorthy M. S., 1975, SIGACT News, V7, DOI 10.1145/990518.990521

[6]

LUCCIO F, 1978, 16 ANN ALL C, P73

[7]

Papadimitriou C. H., 1977, Theoretical Computer Science, V4, P237, DOI 10.1016/0304-3975(77)90012-3

[8]

PLESNIK J, UNPUB IPL

[9]

Shiloach Y., 1976, THESIS WEIZMANN I SC

[10]

VALIANT LG, 1979, UNPUB