An Algorithm for Subgraph Isomorphism
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
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.
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.