Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
2
Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.
其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。
3
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.