全部

1·Its expansion gives all directed trees of the graph g.

它的展开式将给出图g的全部有向树。

2·Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.

其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。