DocumentCode
2201612
Title
Depth-first search and linear graph algorithms
Author
Tarjan, Robert
fYear
1971
fDate
13-15 Oct. 1971
Firstpage
114
Lastpage
121
Abstract
The value of depth-first search or "backtracking" as a technique for solving graph problems is illustrated by two examples. An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E + k3 for some constants k1, k2, and k3, where V is the number of vertices and E is the number of edges of the graph being examined.
Keywords
Chemistry; Computer science; Electrical engineering; Erbium; Information retrieval; Sociology; TV; Tail; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1971., 12th Annual Symposium on
Conference_Location
East Lansing, MI, USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1971.10
Filename
4569669
Link To Document