BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-84-1028
       ENTRY:: May 27, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Parallel graph algorithms
        TYPE:: Technical Report
      AUTHOR:: Hochschild, Peter H.
      AUTHOR:: Mayr, Ernst W.
      AUTHOR:: Siegel, Alan R.
        DATE:: December 1984
       PAGES:: 60
    ABSTRACT:: This paper presents new paradigms to solve efficiently a
               variety of graph problems on parallel machines. These
               paradigms make it possible to discover and exploit the
               "parallelism" inherent in many classical graph problems. We
               abandon attempts to force sequential algorithms into parallel
               environments for such attempts usually result in transforming
               a good uniprocessor algorithm into a hopelessly greedy
               parallel algorithm. We show that by employing more local
               computation and mild redundance, a variety of problems can be
               solved in a resource- and time-efficient manner on a variety
               of architectures.
       NOTES:: [Adminitrivia V1/Prg/19950527]
         END:: STAN//CS-TR-84-1028