Università di Pisa
Sistema bibliotecario di ateneo

Another PRAM algorithm for finding connected components of sparse graphs

Bellia, Marco and Occhiuto, Maria Eugena (1999) Another PRAM algorithm for finding connected components of sparse graphs. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (89Kb)


    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.

    Item Type: Book
    Uncontrolled Keywords: Undirected graph, connected components, algorithms
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 27 Jan 2015 09:54
    Last Modified: 27 Jan 2015 09:54
    URI: http://eprints.adm.unipi.it/id/eprint/2022

    Repository staff only actions

    View Item