Computing Biconnected Components on a Hypercube (1991)
by
Jinwoon Woo
,
Sartaj Sahni
| Venue: | the Department of Computer Science, University of Minnesota |
| Citations: | 12 - 1 self |
BibTeX
@TECHREPORT{Woo91computingbiconnected,
author = {Jinwoon Woo and Sartaj Sahni},
title = {Computing Biconnected Components on a Hypercube},
institution = {the Department of Computer Science, University of Minnesota},
year = {1991}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe two hypercube algorithms to find the biconnected components (i.e., blocks) of a connected undirected graph. One is a modified version of the Tarjan-Vishkin algorithm. The two hypercube algorithms were experimentally evaluated on an NCUBE/7 MIMD hypercube computer. The two algorithms have comparable performance and efficiencies as high as 0.7 were observed.
Citations
| 88 | Parallel matrix and graph algorithms - DEKEL, NASSIMI, et al. - 1981 |
