Study on the Strongly Connexity Identification Algorithm for the Parallel Computation

摘要：

In this article, we put forward a sort of new strongly connexity identification n algorithm which can make the two-time search in the decision process can be implemented at the same time, and this algorithm is convenient for the parallel computation.

关键词： digraph Strong connexity Parallel computation Search

作者: Ruixian Li

作者单位: School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo, China

会议类型: 国际会议

会议名称: The Third International Conference on Modelling and Simulation(第三届国际建模、计算、仿真、优化及其应用学术会议 ICMS 2010)

会议地点: 无锡

会议语种:英文

页码: 132-134

在线出版日期: 2010-06-04（万方平台首次上网日期，不代表论文的发表时间）