COMPUTING BICONNECTED COMPONENTS ON A HYPERCUBE

被引：0
|
作者：
WOO, JW [1 ]
SAHNI, S [1 ]
机构：
[1] UNIV FLORIDA,GAINESVILLE,FL 32611
来源：
JOURNAL OF SUPERCOMPUTING | 1991年 / 5卷 / 01期
关键词：
HYPERCUBE COMPUTING; MIMD COMPUTER; PARALLEL PROGRAMMING; BICONNECTED COMPONENTS;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We describe two hypercube algorithms to find the biconnected components of a dense connected undirected graph. One is a modified version of the Tarjan-Vishkin algorithm and the other is an adaptation of Read's sequential algorithm. The two hypercube algorithms were experimentally evaluated on a NCUBE/7 MIMD hypercube computer. The two algorithms have comparable performance, and efficiencies as high as 0.7 were observed on dense graphs.
引用
收藏
页码：73 / 87
页数：15
相关论文
共 50 条
12345