46
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 213-221 | Received 01 Nov 1986, Published online: 19 Mar 2007

References

  • Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Addison-Wesley .
  • Esfhanian , A.H. and Hakimi , S.L. 1984 . On Computing the Connectivities of Graphs . Networks , 14 : 355 – 366 .
  • Even , S. and Tarjan , R.E. 1975 . Networkflow and testing graph connectivity . SIAM. J. Comput , 4 ( 4 ) : 507 – 518 .
  • Galil , Z. 1980 . Finding the vertex connectivity of graphs . SIAM. J. Comput , 9 ( 1 ) : 197 – 199 .
  • Granot , F. and Hassin , R. 1986 . Multiterminal maximum flows in node capacitated networks . Discrete Appl. Math , 13 ( 2,3 ) : 157 – 163 .
  • Hopcroft , J.E. and Tarjan , R.E. 1973 . Dividing a graph into triconnected components . SIAM. J. Comput , 2 ( 3 ) : 135 – 158 .
  • 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 .
  • Matula , David W. 1978 . k-Blocks and ultrablocks in graphs . J. Combinatorial Theory, Ser , B24 : 1 – 13 .
  • Menger , K. 1927 . Zur allgemeinen Kurventheorie . Fund. Math , 10 : 96 – 115 .
  • Schnorr , C.P. 1979 . Bottlenecks and edge connectivity in unsymmetrical networks . SIAM. J. Comput , 8 ( 2 ) : 265 – 274 .
  • Tarjan , R. 1972 . Depth-first search and linear graph algorithms . SIAM. J. Comput , 1 ( 2 ) : 146 – 160 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.