Article thumbnail

Another PRAM algorithm for finding connected components of sparse graphs

By Marco Bellia and Maria Eugena Occhiuto

Abstract

We present an algorithm which exploits a new approach to the problem of finding the connected components of an undirected graph, CCug for short, with v vertices and e edges. The algorithm has depth O(log**2(e)) (where log is the logarithm whose base is 2) on a CREW PRAM using e processors, hence its cost is not affected by the number v of graph vertices. This makes the algorithm the one with best speedup and best cost for CCug on highly sparse graphs. On dense graphs conversely, its performance is comparable to the one of the algorithm defined by Han and Wagner in 1990 and a little worse than the one defined by Chong and Lam in 1995. A variant of the algorithm with the same bound but running on the EREW model is also included. The algorithm can be used to find the transitive closure of binary, symmetric relations. In this case e is the number of axioms and v is the range of the relation

Topics: INF/01 - Informatica
Publisher: Università di Pisa
Year: 1999
OAI identifier: oai:eprints.adm.unipi.it:2022
Provided by: UnipiEprints
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.adm.unipi.it/20... (external link)
  • http://eprints.adm.unipi.it/20... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.