在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。

On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.

youdao

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

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

youdao

这里有幅更好的图。我说经过 C 的是 C 左边的这个阴影平行四边形。

Here is a better picture. I claim that what will be going through C is this shaded parallelogram to the left of C.

youdao