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 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.

Keywords

  1. Algorithm
  2. backtracking
  3. biconnectivity
  4. connectivity
  5. depth-first
  6. graph
  7. search
  8. spanning tree
  9. strong-connectivity

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
B. L. Fox, D. M. Landy, An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix, Comm. ACM, 11 (1968), 619–621
2.
Solomon W. Golomb, Leonard D. Baumert, Backtrack programming, J. Assoc. Comput. Mach., 12 (1965), 516–524
3.
Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London, 1969ix+274
4.
J. Hopcroft, R. Tarjan, Efficient algorithms for graph manipulation, Tech. Rep., 207, Computer Science Department, Stanford University, Stanford, Calif., 1971
5.
J. Hopcroft, R. Tarjan, A $V^{2}$ algorithm for determining isomorphism of planar graphs, Information Processing Letters, 1 (1971), 32–34
6.
J. Hopcroft, R. Tarjan, Planarity testing in VlogV steps: Extended abstract, Tech. Rep., 201, Computer Science Department, Stanford University, Stanford, Calif., 1971
7.
J. Hopcroft, An NlogN algorithm for isomorphism of planar triply connected graphs, Tech. Rep., 192, Computer Science Department, Stanford University, Stanford, Calif., 1971
8.
J. E. Hopcroft, R. E. Tarjan, Isomorphism of planar graphsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y., 1972), Plenum, New York, 1972, 131–152, 187–212
9.
J. Hopcroft, J. Ullman, A linear list-merging algorithm, Tech. Rep., 71-111, Cornell University Computer Science Department, Ithaca, N. Y., 1971
10.
I. Munro, Efficient determination of the strongly connected components and transitive closure of a directed graph, Department of Computer Science, University of Toronto, 1971
11.
N. J. Nilson, Problem Solving Methods in Artificial Intelligence, McGraw-Hill, New York, 1971
12.
Keith Paton, An algorithm for the blocks and cutnodes of a graph, Comm. ACM, 14 (1971), 468–475
13.
P. W. Purdom, A transitive closure algorithm, Tech. Rep., 33, Computer Sciences Department, University of Wisconsin, Madison, 1968
14.
R. W. Shirey, Masters Thesis, Implementation and analysis of efficient graph planarity testing algorithms, Doctoral thesis, Computer Sciences Department, University of Wisconsin, Madison, 1969
15.
R. Tarjan, An efficient planarity algorithm, Tech. Rep., 244, Computer Science Department, Stanford University, Stanford, Calif., 1971

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 146 - 160
ISSN (online): 1095-7111

History

Submitted: 30 August 1971
Published online: 13 July 2006

Keywords

  1. Algorithm
  2. backtracking
  3. biconnectivity
  4. connectivity
  5. depth-first
  6. graph
  7. search
  8. spanning tree
  9. strong-connectivity

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By