频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
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.
图同构的判定性问题是图论理论中的一个难题，至今没有得到彻底解决。
How to determine the isomorphism of graphs is a difficult problem of graph theory, which has not been completely solved so far.
应用推荐