The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex. 通过单个顶点的相似度特征，将子图同构问题转化为顶点之间的匹配问题。
To solve the problem of matching between operational tasks and resources, a match model and its solving algorithm are presented. 摘要针对作战任务和作战资源的匹配问题，提出了一种匹配模型及其求解算法。
