Acta Informatica

, Volume 6, Issue 2, pp 171–185

Edge-disjoint spanning trees and depth-first search

  • Robert Endre Tarjan
Article

DOI: 10.1007/BF00268499

Cite this article as:
Tarjan, R.E. Acta Informatica (1976) 6: 171. doi:10.1007/BF00268499

Summary

This paper presents an algorithm for finding two edge-disjoint spanning trees rooted at a fixed vertex of a directed graph. The algorithm uses depthfirst search and an efficient method for computing disjoint set unions. It requires O ((e, n)) time and O(e) space to analyze a graph with n vertices and e edges, where α (e, n) is a very slowly growing function related to a functional inverse of Ackermann's function.

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • Robert Endre Tarjan
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA