A novel method, the circuit simulation algorithm, is proposed here, which transfers the graph isomorphism problem into the identical circuits problem.
提出了一种新的同构判定算法：电路模拟法，即将图的同构问题转化为电路的相同问题。
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。
Isomorphism identification is an important and difficult problem in mechanism type synthesis, it is also one of the most difficult problems in graph theory.
同构识别是机构类型综合中一个重要而又困难的问题，同时，也是图论中非常难解决的问题之一。
应用推荐