JOURNAL BROWSE
Search
Advanced SearchSearch Tips
RECOGNITION OF STRONGLY CONNECTED COMPONENTS BY THE LOCATION OF NONZERO ELEMENTS OCCURRING IN C(G)
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
RECOGNITION OF STRONGLY CONNECTED COMPONENTS BY THE LOCATION OF NONZERO ELEMENTS OCCURRING IN C(G)
Kim, Koon-Chan; Kang, Young-Yug;
  PDF(new window)
 Abstract
One of the intriguing and fundamental algorithmic graph problems is the computation of the strongly connected components of a directed graph G. In this paper we first introduce a simple procedure for determining the location of the nonzero elements occurring in without fully inverting B, where are diagonally dominant matrices with $b_{ii}\;>\;0$ for all i and , for , and then, as an application, show that all of the strongly connected components of a directed graph G can be recognized by the location of the nonzero elements occurring in the matrix $C(G)\;
 Keywords
strongly connected components;directed graph;inverse matrix;diagonally dominant matrix;
 Language
English
 Cited by
 References
1.
Data structures and algorithms, 1983.

2.
Graph theory an algorithmic approach, 1975.

3.
Introduction to algorithms, 1990.

4.
Inform. Process. Lett., 2000. vol.74. 3;4, pp.107-114 crossref(new window)

5.
Matrix computations, 1983.

6.
Stud. Cerc. Mat, 1976. vol.28. 1, pp.57-60

7.
Comput. Math. Appl., 1981. vol.7. 1, pp.67-22 crossref(new window)

8.
SIAM J. Comput., 1972. vol.1. 2, pp.146-160 crossref(new window)

9.
Econometrica, 1950. vol.18. pp.142-154 crossref(new window)

10.
Inform. Process. Lett., 2002. vol.83. 1, pp.17-19 crossref(new window)