1. V Aho Alfred , E Hopcroft John , D Ullman Jeffrey , V Aho Alfred , H Bracht Glenn , D Hopkin Kenneth , C Stanley Julian , Brachu Jean-Pierre , Brown A Samler , Brown A Peter , 1983 . Data structures and algorithms. USA: Addison-Wesley. V Aho Alfred, E Hopcroft John, D Ullman Jeffrey, V Aho Alfred, H Bracht Glenn, D Hopkin Kenneth, C Stanley Julian, Brachu Jean-Pierre, Brown A Samler, Brown A Peter, et al. 1983. Data structures and algorithms. USA: Addison-Wesley.
2. Ecological subsystems via graph theory: the role of strongly connected components
3. Computing Strongly Connected Components in Parallel on CUDA
4. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
5. Don Coppersmith , Lisa K. Fleischer , Bruce Hendrickson , and Ali Pinar . 2001. A Divide-And-Conquer Algorithm For Identifying Strongly Connected Components . January 2006 (2001), 1--9. Don Coppersmith, Lisa K. Fleischer, Bruce Hendrickson, and Ali Pinar. 2001. A Divide-And-Conquer Algorithm For Identifying Strongly Connected Components. January 2006 (2001), 1--9.