摘要
已知一个无向图G(V,E),|V|=n,|E|=m,本文基于SIMD共享存贮模型,运用数据在图中快速传播原理,建议了一个新的求图的连通分支算法,具体来讲,在SIMD—CREW共享存贮模型上,求图的连通分支需O(log^2n)时间、O(n^2/logn)处理器;而在SIMD—CRCW共享存贮模型上需O(logn)时间、O(n^2)处理器,建议的算法同著名的Hirschberg算法相比,其主要差别表现在:1)采用的求解方法不同;2)建议的算法简单易懂;3)在某些实际网络如树网上,实现建议的算法有较好的时间复杂性。
Given an undirected graph G(V,E), |V|=n,|E|=m. Based on SIMD shared memory model, a new parallel algorithm for computing connected components of graphs is proposed by using fast data transmission principle. As a result, the algorithm requires O(log2n) time and O(n2/logn) processors on SIMD-CREW shared memory model. But on SIMD-CRCW shared memory model, the algorithm only requires O (logn) time and O(n2) processors. To compare our algorithm with known Hirschberg's algorithm, there exists some differences. The major differences are identified as:l)the way to solve this problem is different; 2)proposed algorithm is simple and easy to understand;3)proposed algorithm's implementation on some practical networks such as mesh-of-tree has better time complexity.
出处
《软件学报》
EI
CSCD
北大核心
1993年第4期61-65,F004,共6页
Journal of Software
基金
国家863计划资金
