EFFICIENT GRAPH AUTOMORPHISM BY VERTEX PARTITIONING

被引：9

作者：

FOWLER, G

HARALICK, R

GRAY, FG

FEUSTEL, C

GRINSTEAD, C

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV, DEPT MATH, BLACKSBURG, VA 24061 USA

[2] SWARTHMORE COLL, DEPT MATH, SWARTHMORE, PA 19081 USA

来源：

ARTIFICIAL INTELLIGENCE | 1983年 / 21卷 / 1-2期

关键词：

D O I：

10.1016/S0004-3702(83)80012-5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：245 / 269

页数：25

共 31 条

[1]

BARROW HG, 1971, MACHINE INTELLIGENCE, V6

[2] REFINED VERTEX CODES AND VERTEX PARTITIONING METHODOLOGY FOR GRAPH ISOMORPHISM TESTING [J].

BHAT, KVS .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (10) :610-615

[3] BACKTRACK PROGRAMMING TECHNIQUES [J].

BITNER, JR ;

REINGOLD, EM .

COMMUNICATIONS OF THE ACM, 1975, 18 (11) :651-656

[4]

BOLLES RC, 1979, P SPIE TECH S IMAGIN

[5] A SUBGRAPH ISOMORPHISM ALGORITHM USING RESOLUTION [J].

CHENG, JK ;

HUANG, TS .

PATTERN RECOGNITION, 1981, 13 (05) :371-379

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

CORNEIL, DG ;

GOTLIEB, CC .

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

[7]

Gaschnig J, 1977, P INT JOINT C ART IN, P457

[8] FURTHER ANNOTATED-BIBLIOGRAPHY ON THE ISOMORPHISM DISEASE [J].

GATI, G .

JOURNAL OF GRAPH THEORY, 1979, 3 (02) :95-109

[9] GRAPH OPTIMAL MONOMORPHISM ALGORITHMS [J].

GHAHRAMAN, DE ;

WONG, AKC ;

AU, T .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (04) :181-188

[10] THE CONSISTENT LABELING PROBLEM .2. [J].

HARALICK, RM ;

SHAPIRO, LG .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1980, 2 (03) :193-203

← 1 2 3 4 →