Path-based depth-first search for strong and biconnected components

Information Processing Letters

Volumn 74, Issue 3, 2000, Pages 107-114

  Gabow, Harold N ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

BIOCONNECTED COMPONENTS; DEPTH-FIRST SEARCH; STRONGLY CONNECTED COMPONENTS;

COMPUTATION THEORY;

EID: 0033735089     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00051-X     Document Type: Article

References (25)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Aho A.V., Hopcroft J.E., Ullman J.D. Data Structures and Algorithms. 1983;Addison-Wesley, Reading, MA.
3. Berge C. Hypergraphs: Combinatorics of Finite Sets. 1989;North-Holland, New York.
4. Brassard G., Bratley P. Algorithmics: Theory & Practice. 1988;Prentice-Hall, Englewood Cliffs, NJ.
5. Brassard G., Bratley P. Fundamentals of Algorithmics. 1996;Prentice-Hall, Englewood Cliffs, NJ.
6. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;McGraw-Hill, New York.
7. Even S. Graph Algorithms. 1979;Computer Science Press, Potomac, MD.
8. Gabow H.N. Path-based depth-first search for strong and biconnected components. Tech. Report CU-CS-890-99, revised version:2000;Dept. of Computer Science, University of Colorado at Boulder.
9. Gabow H.N., Tarjan R.E. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci. Vol. 30:(2):1985;209-221.
10. Hopcroft J.E., Tarjan R.E. Dividing a graph into triconnected components. SIAM J. Comput. Vol. 2:1973;135-158.
11. Hopcroft J.E., Tarjan R.E. Efficient planarity testing. J. ACM. Vol. 21:(4):1974;549-568.
12. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
13. Horowitz E., Sahni S., Rajasekaran S. Computer Algorithms. 1998;Computer Science Press, New York.
14. Knuth D.E. The Stanford Graphbase: A Platform for Combinatorial Computing. 1993;Addison-Wesley, Reading, MA.
15. Lovász L. Combinatorial Problems and Exercises. 2nd edn. 1993;North-Holland, New York.
16. Manber U. Introduction to Algorithms: A Creative Approach. 1989;Addison-Wesley, Reading, MA.
17. Mehlhorn K. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. 1984;Springer, New York.
18. Munro I. Efficient determination of the strongly connected components and transitive closure of a directed graph. 1971;Department of Computer Science, University of Toronto.
19. Purdom P.W. A transitive closure algorithm. Tech. Report 33:1968;Computer Sciences Department, University of Wisconsin, Madison, WI.
20. Robbins H.E. A theorem on graphs with an application to a problem of traffic control. Amer. Math. Monthly. Vol. 46:1939;281-283.
21. Sedgewick R. Algorithms in C. 1990;Addison-Wesley, Reading, MA.
22. Sharir M. A strong-connectivity algorithm and its application in data flow analysis. Comput. Math. Appl. Vol. 7:(1):1981;67-72.
23. Tarjan R.E. Depth-first search and linear graph algorithms. SIAM J. Comput. Vol. 1:(2):1972;146-160.
24. Tarjan R.E. Efficiency of a good but not linear set union algorithm. J. ACM. Vol. 22:(2):1975;215-225.
25. Weiss M.A. Data Structures and Algorithm Analysis in C++. 1999;Addison-Wesley, Reading, MA.