Edge-disjoint spanning trees, dominators, and depth-first search.

Authors:
Robert E Tarjan
Affiliations:
-
Venue:
Edge-disjoint spanning trees, dominators, and depth-first search.
Year:
1974

Citing 0
Cited 2

A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing strong articulation points and strong bridges in large scale graphs

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.