Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185437

Donald B. Johnson, P. Metaxas

引用次数: 19

Abstract

Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.<>

查看原文本刊更多论文

连接组件在O(lg/sup 3/2 mod V/ mod)并联时间为CREW PRAM

计算无向图G=(V, E)在V mod =n个顶点和E mod =m条边上的连通分量。提出了一种使用n+m CREW处理器，运行时间为O(lg/sup 3/2/ n)的高效简单算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量