isomorphism problem的用法和樣例：
例句
- Determining whether two graphs are isomorphic is referred to as the graph isomorphism problem.
確定是否是同構的兩個(gè)圖形稱(chēng)為圖同構問(wèn)題。 - The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex.
通過(guò)單個(gè)頂點(diǎn)的相似度特征，將子圖同構問(wèn)題轉化為頂點(diǎn)之間的匹配問(wèn)題。
