This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th Annual Symposium on Switching and Automata Theory (SWAT 1971)
Depth-first search and linear grajh algorithms
October 13-October 15
ASCII Text
x 
 
Robert Tarjan, "Depth-first search and linear grajh algorithms," Foundations of Computer Science, IEEE Annual Symposium on, pp. 114-121, 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), 1971.
 
 
BibTex
x
 
@article{ 10.1109/SWAT.1971.10,
author = {Robert Tarjan},
title = {Depth-first search and linear grajh algorithms},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1971},
issn = {0272-4847},
pages = {114-121},
doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1971.10},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Depth-first search and linear grajh algorithms
SN - 0272-4847
SP114
EP121
A1 - Robert Tarjan,
PY - 1971
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
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.
Citation:
Robert Tarjan, "Depth-first search and linear grajh algorithms," focs, pp.114-121, 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), 1971
Usage of this product signifies your acceptance of the Terms of Use.