Tarjan erősen összefüggő komponensek algoritmusa (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Tarjan erősen összefüggő komponensek algoritmusa" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

1,564^th place

4,669^th place

low place

low place

cmu.edu

Lecture #19: Depth First Search and Strong Components. 15-451/651: Algorithms Fall 2018 pp. 7-8. Carnegie Mellon University. (Hozzáférés: 2021. augusztus 9.)

Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms", SIAM Journal on Computing 1 (2): 146–160, DOI 10.1137/0201010
Nuutila, Esko (1994). „On Finding the Strongly Connected Components in a Directed Graph”. Information Processing Letters 49, 9–14. o. DOI:10.1016/0020-0190(94)90047-7.
Pearce, David. „A Space Efficient Algorithm for Detecting Strongly Connected Components”. Information Processing Letters 116, 47–52. o. DOI:10.1016/j.ipl.2015.08.010.