강한 연결 요소 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "강한 연결 요소" in Korean language version.

refsWebsite

Global rank Korean rank

2^nd place

3^rd place

low place

low place

8,211^th place

179^th place

146^th place

1^st place

1,564^th place

629^th place

26^th place

70^th place

cmu.edu

Blelloch, Guy; Gu, Yan; Shun, Julian; and Sun, Yihan. Parallelism in Randomized Incremental Algorithms. SPAA 2016. doi:10.1145/2935764.2935766.

Tarjan, R. E. (1972), “Depth-first search and linear graph algorithms”, 《SIAM Journal on Computing》 1 (2): 146–160, doi:10.1137/0201010
Aspvall, Bengt; Plass, Michael F.; Tarjan, Robert E. (1979), “A linear-time algorithm for testing the truth of certain quantified boolean formulas”, 《Information Processing Letters》 8 (3): 121–123, doi:10.1016/0020-0190(79)90002-4 .
Dulmage, A. L. & Mendelsohn, N. S. (1958), “Coverings of bipartite graphs”, 《Can. J. Math.》 10: 517–534, doi:10.4153/cjm-1958-052-0 .
Robbins, H. E. (1939), “A theorem on graphs, with an application to a problem on traffic control”, 《American Mathematical Monthly》 46: 281–283, doi:10.2307/2303897, JSTOR 2303897 .

Robbins, H. E. (1939), “A theorem on graphs, with an application to a problem on traffic control”, 《American Mathematical Monthly》 46: 281–283, doi:10.2307/2303897, JSTOR 2303897 .

Fleischer, Lisa K; Hendrickson, Bruce; and Pinar, Ali. On identifying strongly connected components in parallel. IPDPS 2000.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 22.5, pp. 552–557.
Micha Sharir. A strong connectivity algorithm and its applications to data flow analysis. Computers and Mathematics with Applications 7(1):67–72, 1981.