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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 371-379 |
| Number of pages | 9 |
| Journal | Pattern Recognition |
| Volume | 13 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1981 |
Keywords
- Constraint set
- Feasibility
- Relaxation
- Resolution
- Subgraph isomorphism
- Tree search
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence
Cite this
Cheng, J. K., & Huang, T. S. (1981). A subgraph isomorphism algorithm using resolution. Pattern Recognition, 13(5), 371-379. https://doi.org/10.1016/0031-3203(81)90093-5