Parallel Algorithm for Transitive Closure

Article View: comp.theory

Article #1813

#1813

From: Srinivas Kankanahalli
Date: Thu, 20 Jun 1991 12:41

16 lines
1084 bytes

Hi
    Can someone please give me pointers to parallel algorithms for transitive closure? What are the known parallel bounds for these algorithms on various PRAM models??

Thanks in Advance

Srinivas Kankanahalli

email: srini@cs.wvu.wvnet.edu or sriniv@cerc.wvu.wvnet.edu


-- 
=========================== MODERATOR ==============================
Steve Stevenson                            {steve,fpst}@hubcap.clemson.edu
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell

Technical Details

Message-ID: <1991Jun20.174007.19281@hubcap.clemson.edu>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ncar!gatech!hubcap!fpst

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ncar!gatech!hubcap!fpst
From: sriniv@cathedral.cerc.wvu.wvnet.edu (Srinivas Kankanahalli)
Newsgroups: comp.theory,comp.parallel
Subject: Parallel Algorithm for Transitive Closure
Message-ID: <1991Jun20.174007.19281@hubcap.clemson.edu>
Date: 20 Jun 91 12:41:29 GMT
Sender: news@cathedral.cerc.wvu.wvnet.edu
Followup-To: poster
Organization: Clemson University
Lines: 9
Approved: parallel@hubcap.clemson.edu