摘要
The structure-preserved error-correcting graph isomorphism proposed by Tsai and Fu [1] for matching patterns represented by attributed relational graphs is extended to the case of subgraphs. The resulting subgraph error-correcting isomorphism, which includes the structure-preserved error-correcting graph isomorphism as a special case, is useful for recognizing partially viewed or structurally distorted patterns. After formulating a subgraph error-correcting isomorphism as a state-space tree-search problem, heuristic information useful for speeding up the search is suggested and an ordered-search algorithm is proposed for finding an optimal subgraph error-correcting isomorphism.
| 原文 | American English |
|---|---|
| 頁（從 - 到） | 48-62 |
| 頁數 | 15 |
| 期刊 | IEEE Transactions on Systems, Man and Cybernetics |
| 卷 | SMC-13 |
| 發行號 | 1 |
| DOIs | |
| 出版狀態 | Published - 2月 1983 |