Depth-First Search and Linear Graph Algorithms (Working Paper)

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.

[1]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[2]  Robert E. Tarjan,et al.  An efficient planarity algorithm , 1971 .

[3]  Robert E. Tarjan,et al.  A V² Algorithm for Determining Isomorphism of Planar Graphs , 1971, Inf. Process. Lett..

[4]  Paul Walton Purdom,et al.  A transitive closure algorithm , 1970, BIT.

[5]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .

[6]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[7]  Frank Harary,et al.  Graph Theory , 2016 .