BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-207
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Efficient algorithms for graph manipulation
        TYPE:: Technical Report
      AUTHOR:: Hopcroft, John E.
      AUTHOR:: Tarjan, Robert Endre
        DATE:: March 1971
       PAGES:: 24
    ABSTRACT:: Efficient algorithms are presented for partitioning a graph
               into connected components, biconnected components and simple
               paths. The algorithm for partitioning of a graph into simple
               paths is iterative and each iteration produces a new path
               between two vertices already on paths. (The start vertex can
               be specified dynamically.) If V is the number of vertices and
               E is the number of edges each algorithm requires time and
               space proportional to max(V,E) when executed on a random
               access computer.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-207