Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!elroy.jpl.nasa.gov!ncar!gatech!hubcap!fpst
From: marcoz@enquirer.scandal.cs.cmu.edu (Marco Zagha)
Newsgroups: comp.parallel
Subject: Applications of connected components
Keywords: connected components, graph algorithms
Message-ID: <1991Jun18.121059.13919@hubcap.clemson.edu>
Date: 17 Jun 91 21:11:01 GMT
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Organization: Carnegie-Mellon University, CS/RI
Lines: 18
Approved: parallel@hubcap.clemson.edu


I would like to find out what applications on parallel or vector machines make
use of a connected components subroutine.

How much of the total running time of your application is taken up by the
connected components calculation?  If you had a fast connected components
algorithm available, would it change your approach to solving your problem?

How fast is your current implementation?  What algorithm do you use?
What types of graphs do you typically see?

Please reply by e-mail.  Send me mail if you would like a summary.

Thank you,

Marco Zagha
School of Computer Science, Carnegie Mellon University
Internet: marcoz@cs.cmu.edu            Uucp:   ...!seismo!cs.cmu.edu!marcoz
Bitnet:   marcoz%cs.cmu.edu@cmuccvma   CSnet:  marcoz%cs.cmu.edu@relay.cs.net

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