RECOGNITION OF STRONGLY CONNECTED COMPONENTS BY THE LOCATION OF NONZERO ELEMENTS OCCURRING IN C(G) = (D - A(G))-1 |
Kim, Koon-Chan
(Department of Mathematics, Keimyung University)
Kang, Young-Yug (Department of Mathematics, Keimyung University) |
1 |
A strong-connectivity algorithm and its application in data flow analysis
/
DOI ScienceOn |
2 |
/
|
3 |
A simplified correctness proof for a well-known algorithm computing strongly connected components
/
DOI ScienceOn |
4 |
Depth-first search and linear graph algorithms
/
DOI |
5 |
An algorithm for deterining the strongly connected components of a finite directed graph
/
|
6 |
/
|
7 |
/
|
8 |
Path-based depth-first search for strong and biconnected components
/
DOI ScienceOn |
9 |
Inversion of the Leontief matrix by power series
/
DOI ScienceOn |
10 |
/
|