|Title:||On the Possibilities of DFS Tree Constructions: Sequential and Parallel Algorithms
|Authors:||E. Korach and Z. Ostfeld
|Abstract:||The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Every application of the DFS involves, beside traversing the graph, constructing a special structured tree, called a "DFS tree" that may be used subsequently. We raise two important questions regarding the structure of the DFS tree that is obtained, and discuss their solutions.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0508), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion