An algorithm for finding all the k-components of a digraph

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Addison-Wesley .
   Google Scholar
• Esfhanian , A.H. and Hakimi , S.L. 1984 . On Computing the Connectivities of Graphs . Networks , 14 : 355 – 366 .
   Google Scholar
• Even , S. and Tarjan , R.E. 1975 . Networkflow and testing graph connectivity . SIAM. J. Comput , 4 ( 4 ) : 507 – 518 .
   Google Scholar
• Galil , Z. 1980 . Finding the vertex connectivity of graphs . SIAM. J. Comput , 9 ( 1 ) : 197 – 199 .
   Web of Science ®Google Scholar
• Granot , F. and Hassin , R. 1986 . Multiterminal maximum flows in node capacitated networks . Discrete Appl. Math , 13 ( 2,3 ) : 157 – 163 .
   Web of Science ®Google Scholar
• Hopcroft , J.E. and Tarjan , R.E. 1973 . Dividing a graph into triconnected components . SIAM. J. Comput , 2 ( 3 ) : 135 – 158 .
   Google Scholar
• Matula , D.W. 1977 . “ Graph theoretic techniques for cluster analysis algorithm ” . In Classification and Clustering , Edited by: Van Ryzon , F. 95 – 129 . New York : Academic Press .
   Google Scholar
• Matula , David W. 1978 . k-Blocks and ultrablocks in graphs . J. Combinatorial Theory, Ser , B24 : 1 – 13 .
   Google Scholar
• Menger , K. 1927 . Zur allgemeinen Kurventheorie . Fund. Math , 10 : 96 – 115 .
   Google Scholar
• Schnorr , C.P. 1979 . Bottlenecks and edge connectivity in unsymmetrical networks . SIAM. J. Comput , 8 ( 2 ) : 265 – 274 .
   Web of Science ®Google Scholar
• Tarjan , R. 1972 . Depth-first search and linear graph algorithms . SIAM. J. Comput , 1 ( 2 ) : 146 – 160 .
   Google Scholar