This paper suggests an isomorphism detecting algorithm based on equivalent class, which improves the efficiency of context isomorphism detection.
本文提出的基于等价类法的形式背景同构判定算法,有效地提高了同构判定的效率。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG,我们证明了:其变元改名和文字改名的复杂性等价于图同构问题GI。
This paper also proposes the qualities of adjacency matrix, derives the theorem of the relations between isomorphism and equivalent adjacency matrix.
提出关联矩阵的性质,推导出同型机构和等价关联矩阵关系的定理。
应用推荐