论文信息 - Depth-First Search and Linear Graph Algorithms

Depth-First Search and Linear Graph Algorithms

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.

Robert E. Tarjan | R. Tarjan

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

[2] Bennett L. Fox,et al. Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix , 1967, Commun. ACM.

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

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

[5] Robert E. Tarjan,et al. Planarity Testing in V log V Steps: Extended Abstract , 1971, IFIP Congress.

[6] J. Hopcroft. An n log n algorithm for isomorphism of planar triply connected graphs , 1971 .

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

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

[9] Keith Paton,et al. An algorithm for the blocks and cutnodes of a graph , 1971, Commun. ACM.

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

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