BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-74-455
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Edge-disjoint spanning trees, dominators, and depth-first
               search.
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
        DATE:: September 1974
       PAGES:: 42
    ABSTRACT:: This paper presents an algorithm for finding two
               edge-disjoint spanning trees rooted at a fixed vertex of a
               directed graph. The algorithm uses depth-first search, an
               efficient method for computing disjoint set unions, and an
               efficient method for computing dominators. It requires O(V
               log V + E) time and O(V + E) space to analyze a graph with V
               vertices and E edges.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-74-455