@article{d92d552400184c5a9d3013b98d83dcc9,
title = "A subgraph isomorphism algorithm using resolution",
abstract = "An efficient algorithm for subgraph isomorphism is presented. It combines tree search with relaxation by using resolution. Bitwise parallelism, which is an important factor in speed, is achieved during the resolution process even though a sequential computer is used. The algorithm can be easily modified to apply to multi-relation labeled graphs, attributed graphs and some higher order structures such as arrangements.",
keywords = "Constraint set, Feasibility, Relaxation, Resolution, Subgraph isomorphism, Tree search",
author = "Cheng, {J. K.} and Huang, {T. S.}",
note = "Funding Information: The second question really depends on the result of segmentation. For the ideal case, graph isomorphism is enough. If the object and background is nonseparable or missing part (occlusion) is possible, subgraph isomorphism or even common subgraph isomorphism is usually needed. In the case of imperfect segmentation, sometimes we want several to one matching (homomorphism) or even several to several matching (maximal matching). (1°~ Semantics (or attributes) is usually needed because almost any two *This work was supported by the National Science Foundation under Grant No. MCS-78-18906 (monitored by Dr. E Barrett, Mathematical Division, NSF). Copyright: Copyright 2015 Elsevier B.V., All rights reserved.",
year = "1981",
doi = "10.1016/0031-3203(81)90093-5",
language = "English (US)",
volume = "13",
pages = "371--379",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "5",
}