Title: Depth-First Search and Linear Graph Algorithms
Abstract:The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components ...The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by $k_1 V + k_2 E + k_3 $ for some constants $k_1 ,k_2 $, and $k_3 $, where V is the number of vertices and E is the number of edges of the graph being examined.Read More
Publication Year: 1972
Publication Date: 1972-06-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5699
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot