BACKTRACK PROCEDURE FOR ISOMORPHISM OF DIRECTED GRAPHS

被引：24

作者：

BERZTISS, AT ^{[1
]}

机构：

[1] UNIV PITTSBURGH,DEPT COMP SCI,PITTSBURGH,PA 12560

来源：

JOURNAL OF THE ACM | 1973年 / 20卷 / 03期

关键词：

D O I：

10.1145/321765.321766

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：365 / 377

页数：13

共 13 条

[1]

BERZTISS AT, 1969, 4 P AUSTR COMP C AD, P495

[2]

BERZTISS AT, 1971, DATA STRUCTURES THEO

[3] AN EFFICIENT ALGORITHM FOR GRAPH ISOMORPHISM [J].

CORNEIL, DG ;

GOTLIEB, CC .

JOURNAL OF THE ACM, 1970, 17 (01) :51-&

[4]

CORNEIL DG, 1968, THESIS U TORONTO

[5] NONDETERMINISTIC ALGORITHMS [J].

FLOYD, RW .

JOURNAL OF THE ACM, 1967, 14 (04) :636-&

[6] BACKTRACK PROGRAMMING [J].

GOLOMB, SW ;

BAUMERT, LD .

JOURNAL OF THE ACM, 1965, 12 (04) :516-&

[7] FLOW ANALYSIS ALGORITHM [J].

KRIDER, L .

JOURNAL OF THE ACM, 1964, 11 (04) :429-&

[8] MAN-MACHINE APPROACH TOWARD SOLVING TRAVELING SALESMAN PROBLEM [J].

KROLAK, P ;

FELTS, W ;

MARBLE, G .

COMMUNICATIONS OF THE ACM, 1971, 14 (05) :327-&

[9]

NASHWILLIAMS CSJ, 1969, MANY FACETS GRAPH TH

[10]

SALTON G, 1964, P AFIPS, V25, P587

← 1 2 →