An Algorithm for Subgraph Isomorphism

Journal of the ACM - Tập 23 Số 1 - Trang 31-42 - 1976
J. R. Ullmann1
1Division of Computer Science, National Physical Laboratory, Teddington, Middlesex, TW11 OLW, England

Tóm tắt

Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism.

Từ khóa


Tài liệu tham khảo

10.1016/B978-0-12-737140-5.50006-3

10.1145/321765.321766

10.1145/362342.362367

10.1145/321556.321562

10.21236/AD0705364

10.1145/361573.361576

NILSSON , N. J. Problem-Solvzng Methods zn Artzficzal intellzgence . McGraw-Hill , New York , 1971 NILSSON, N. J. Problem-Solvzng Methods zn Artzficzal intellzgence. McGraw-Hill, New York, 1971

OSTEEN , R. E. , AND TOU , J.T. Achque-detectlon algorithm based on neighbourhoods in graphs. lnt J of Comput and Inform Sczs g, 4 (Dec . 1973 ), 257-268. OSTEEN, R. E., AND TOU, J.T. Achque-detectlon algorithm based on neighbourhoods in graphs. lnt J of Comput and Inform Sczs g, 4 (Dec. 1973), 257-268.

10.1145/365628.365648

10.1016/S0146-664X(72)80003-0

ULL~ANN ;- J. R Pattern Recogn~tzon Teehnzques. Butterworths, London, and Crane Russak , New York , 1973 . ULL~ANN;-J. R Pattern Recogn~tzon Teehnzques. Butterworths, London, and Crane Russak, New York, 1973.

Thông tin
Thông tin xuất bản

Journal of the ACM

Tập 23 Số 1

31-42

Thông tin tác giả